On the conjecture of vertex-transitivity of Dcell

2018/05/18 by Huazhong Lü, Lü, Huazhong
Computer Science · Materials Science · Mathematics · #05C75 #68R10 #Combinatorics (math.CO) #FOS: Mathematics #Graph theory and applications #Graphene research and applications #Interconnection Networks and Systems

paper · pdf · doi:10.48550/arxiv.1805.07139

openalex publication_date 2018/05/18 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

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 k≥0 and n≥2. In this paper, we show that D_k,n is vertex-transitive for k≤1 and n≥2, and it is not vertex-transitive for all k≥2 and n≥2.

Related

• Transitivity of Varietal Hypercube Networks
• Algorithmic study of d₂-transitivity of graphs
• A 27-vertex graph that is vertex-transitive and edge-transitive but not l-transitive
• Generalized Vertex Transitivity in Graphs
• On a conjecture concerning vertex-transitive graphs