Improved lower bounds on the degree-diameter problem

DOI10.1007/S10801-018-0822-6zbMATH Open1414.05105OpenAlexW2791447896WikidataQ130120226 ScholiaQ130120226MaRDI QIDQ2423367FDOQ2423367

Authors: Tao Zhang, Gennian Ge 

Publication date: 21 June 2019

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10801-018-0822-6

Recommendations

• Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups
• Cayley graphs of diameter 2 from difference sets
• Abelian Cayley graphs of given degree and diameter 2 and 3
• Cayley graphs of diameter two with order greater than \(0.684\) of the Moore bound for any degree
• Large Cayley graphs on an abelian group

zbMATH Keywords

Cayley graphgroupdegree-diameter problem

Mathematics Subject Classification ID

Distance in graphs (05C12) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Cites Work

• The difference between consecutive primes. II
• On Graphs that do not Contain a Thomsen Graph
• On Moore Graphs with Diameters 2 and 3
• Maximum degree in graphs of diameter 2
• The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
• Note on a “Square” Functional Equation
• A note on large graphs of diameter two and given maximum degree
• A note on large Cayley graphs of diameter two and given degree
• Cayley graphs of diameter two with order greater than \(0.684\) of the Moore bound for any degree
• Cayley graphs of diameter two and any degree with order half of the Moore bound
• Approaching the Moore bound for diameter two by Cayley graphs
• Title not available (Why is that?)
• Abelian Cayley graphs of given degree and diameter 2 and 3
• Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups
• Revisiting the Comellas-Fiol-Gómez constructions of large digraphs of given degree and diameter
• Cayley graphs of diameter 2 from difference sets

Cited In (10)

• Lower Bounds on Lattice Covering Densities of Simplices
• On circuit diameter bounds via circuit imbalances
• The degree/diameter problem for mixed abelian Cayley graphs
• Cayley graphs of diameter 2 from difference sets
• Cayley graphs of diameter two with order greater than \(0.684\) of the Moore bound for any degree
• Abelian Cayley graphs of given degree and diameter 2 and 3
• Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups
• Dense group networks
• Improved hardness of approximation of diameter in the CONGEST model
• Algebraic and computer-based methods in the undirected degree/diameter problem - A brief survey

This page was built for publication: Improved lower bounds on the degree-diameter problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2423367)