Improved lower bounds on the degree-diameter problem
From MaRDI portal
(Redirected from Publication:2423367)
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
Cites work
- scientific article; zbMATH DE number 3412694 (Why is no real title available?)
- A note on large Cayley graphs of diameter two and given degree
- A note on large graphs of diameter two and given maximum degree
- Abelian Cayley graphs of given degree and diameter 2 and 3
- Approaching the Moore bound for diameter two by Cayley graphs
- Cayley graphs of diameter 2 from difference sets
- Cayley graphs of diameter two and any degree with order half of the Moore bound
- Cayley graphs of diameter two with order greater than \(0.684\) of the Moore bound for any degree
- Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups
- Maximum degree in graphs of diameter 2
- Note on a “Square” Functional Equation
- On Graphs that do not Contain a Thomsen Graph
- On Moore Graphs with Diameters 2 and 3
- Revisiting the Comellas-Fiol-Gómez constructions of large digraphs of given degree and diameter
- The Degree-Diameter Problem for Several Varieties of Cayley Graphs I: The Abelian Case
- The difference between consecutive primes. II
Cited in
(10)- Lower Bounds on Lattice Covering Densities of Simplices
- Cayley graphs of diameter 2 from difference sets
- Dense group networks
- Abelian Cayley graphs of given degree and diameter 2 and 3
- Cayley graphs of given degree and diameter for cyclic, Abelian, and metacyclic groups
- On circuit diameter bounds via circuit imbalances
- The degree/diameter problem for mixed abelian Cayley graphs
- Improved hardness of approximation of diameter in the CONGEST model
- Cayley graphs of diameter two with order greater than \(0.684\) of the Moore bound for any degree
- 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)