The diameters of almost all Cayley digraphs
From MaRDI portal
Publication:1375344
DOI10.1007/BF02009550zbMath0889.05054MaRDI QIDQ1375344
Publication date: 11 June 1998
Published in: Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)
05C80: Random graphs (graph-theoretic aspects)
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C12: Distance in graphs
05C20: Directed graphs (digraphs), tournaments
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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