Approaching the Moore bound for diameter two by Cayley graphs

DOI10.1016/j.jctb.2011.07.005zbMath1237.05101MaRDI QIDQ412173

Jana Šiagiová, Jozef Širáň

Publication date: 4 May 2012

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2011.07.005

zbMATH Keywords

Cayley graph; diameter; Moore bound; maximum degree; construction; preassigned degree; veretex transitive graph

Mathematics Subject Classification ID

05C05: Trees

05C25: Graphs and abstract algebra (groups, rings, fields, etc.)

05C12: Distance in graphs

Related Items

Cayley Graphs of Diameter Two from Difference Sets, Cayley graphs of diameter two with order greater than \(0.684\) of the Moore bound for any degree, Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes, Cayley graphs of diameter two and any degree with order half of the Moore bound, Abelian Cayley graphs of given degree and diameter 2 and 3, Asymptotically approaching the Moore bound for diameter three by Cayley graphs, Diameter 2 Cayley graphs of dihedral groups, Improved lower bounds on the degree-diameter problem, On the nonexistence of lattice tilings of \(\mathbb{Z}^n\) by Lee spheres, Moore Graphs and Cycles Are Extremal Graphs for Convex Cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Search for properties of the missing Moore graph
• Examples of products giving large graphs with given degree and diameter
• A note on large graphs of diameter two and given maximum degree
• A note on the McKay-Miller-Širáň graphs
• A note on large Cayley graphs of diameter two and given degree
• Moore graphs and beyond: a survey of the degree/diameter problem
• On Moore Graphs with Diameters 2 and 3
• Maximum degree in graphs of diameter 2
• On Graphs that do not Contain a Thomsen Graph