Conditional edge-fault-tolerant Hamiltonicity of the data center network
From MaRDI portal
Publication:1671332
DOI10.1016/j.dam.2018.03.049zbMath1394.05065OpenAlexW2796635556WikidataQ130006800 ScholiaQ130006800MaRDI QIDQ1671332
Publication date: 6 September 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.049
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10) Deterministic network models in operations research (90B10) Theory of data (68P99) Eulerian and Hamiltonian graphs (05C45)
Related Items (3)
A note on the strong matching preclusion problem for data center networks ⋮ Constructing dual-CISTs of DCell data center networks ⋮ Hamiltonian Cycle Embeddings in Faulty Hypercubes Under the Forbidden Faulty Set Model
Cites Work
- The restricted \(h\)-connectivity of the data center network DCell
- Hamiltonian cycle embedding for fault tolerance in balanced hypercubes
- Conditional edge-fault-tolerant Hamiltonicity of dual-cubes
- Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
- Conditional fault Hamiltonicity of the complete graph
- Hamilton-connectivity and cycle-embedding of the Möbius cubes
- The pessimistic diagnosability of data center networks
- A dual-Hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks.
- Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
- Linearly many faults in Cayley graphs generated by transposition trees
- Panconnectivity, fault-tolerant hamiltonicity and hamiltonian-connectivity in alternating group graphs
- Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks
This page was built for publication: Conditional edge-fault-tolerant Hamiltonicity of the data center network
