On the conjecture of vertex-transitivity of DCell

DOI10.1016/J.IPL.2018.10.017zbMATH Open1470.68063arXiv1805.07139OpenAlexW2804842931WikidataQ122963877 ScholiaQ122963877MaRDI QIDQ1628697FDOQ1628697

Authors: Huazhong Lü 

Publication date: 5 December 2018

Published in: Information Processing Letters (Search for Journal in Brave)

Abstract: Gu et al. in [Inform. Process. Lett. 134 (2018) 52--56] conjectured that the data center network $D_{k,n}$ is vertex-transitive for all $kgeq0$ and $ngeq2$. In this paper, we show that $D_{k,n}$ is vertex-transitive for $kleq1$ and $ngeq2$, and it is not vertex-transitive for all $kgeq2$ and $ngeq2$.

Full work available at URL: https://arxiv.org/abs/1805.07139

Recommendations

• The vertex-pancyclicity of data center networks
• Vertex-transitivity on folded crossed cubes
• The restricted \(h\)-connectivity of the data center network DCell
• Circulants and the Characterization of Vertex-Transitive Graphs
• Hamilton cycles in dense vertex-transitive graphs

zbMATH Keywords

interconnection networkvertex-transitivitydata center network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Cites Work

• Graph theory
• The restricted \(h\)-connectivity of the data center network DCell
• The pessimistic diagnosability of data center networks

Cited In (4)

• Vertex-transitivity on folded crossed cubes
• Symmetric property and edge-disjoint Hamiltonian cycles of the spined cube
• Symmetric property and reliability of locally twisted cubes
• Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes

This page was built for publication: On the conjecture of vertex-transitivity of DCell

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1628697)