Improved lower bounds on the degree-diameter problem
From MaRDI portal
Publication:2423367
DOI10.1007/s10801-018-0822-6zbMath1414.05105OpenAlexW2791447896WikidataQ130120226 ScholiaQ130120226MaRDI QIDQ2423367
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
Related Items (1)
Cites Work
- Unnamed Item
- 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
- 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
- A note on large graphs of diameter two and given maximum degree
- A note on large Cayley graphs of diameter two and given degree
- The Difference Between Consecutive Primes, II
- 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
- Cayley Graphs of Diameter Two from Difference Sets
- On Graphs that do not Contain a Thomsen Graph
- Note on a “Square” Functional Equation
This page was built for publication: Improved lower bounds on the degree-diameter problem