The diameters of almost all Cayley digraphs

DOI10.1007/BF02009550zbMath0889.05054OpenAlexW2034733662MaRDI QIDQ1375344

Xin Liu, Ji Xiang Meng

Publication date: 11 June 1998

Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02009550

zbMATH Keywords

probabilitydiameterstrongly connectedCayley digraphs

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20)

Related Items (2)

Random Latin square graphs ⋮ Infinite circulant digraphs and random infinite circulant digraphs

Cites Work

• A note on partial Cayley graphs
• On the automorphism groups of almost all Cayley graphs
• On the full automorphism group of a graph
• Probability of diameter two for Steinhaus graphs
• On the connectivity of Cayley digraphs
• Minimal diameter double-loop networks: Dense optimal families
• A group-theoretic model for symmetric interconnection networks
• Almost all steinhaus graphs have diameter 2
• The minimum order of a cayley graph with given degree and diameter
• A survey: Hamiltonian cycles in Cayley graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The diameters of almost all Cayley digraphs