Cayley graphs of diameter two and any degree with order half of the Moore bound
From MaRDI portal
Publication:400489
DOI10.1016/j.dam.2014.04.005zbMath1298.05154MaRDI QIDQ400489
Publication date: 22 August 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2014.04.005
05C25: Graphs and abstract algebra (groups, rings, fields, etc.)
05C12: Distance in graphs
05C07: Vertex degrees
Related Items
Cayley graphs of diameter two with order greater than \(0.684\) of the Moore bound for any degree, The degree-diameter problem for outerplanar graphs, Diameter 2 Cayley graphs of dihedral groups, Improved lower bounds on the degree-diameter problem
Cites Work
- Unnamed Item
- Unnamed Item
- Approaching the Moore bound for diameter two by Cayley graphs
- Search for properties of the missing Moore graph
- A note on large graphs of diameter two and given maximum degree
- A note on large Cayley graphs of diameter two and given degree
- Moore graphs and beyond: a survey of the degree/diameter problem
- Maximum degree in graphs of diameter 2
- On Graphs that do not Contain a Thomsen Graph