A connection between a question of Bermond and Bollobás and Ramanujan graphs
From MaRDI portal
(Redirected from Publication:2230812)
Abstract: Let be the order of the largest undirected graphs of maximum degree and diameter , and let be the corresponding Moore bound. In this paper, we give a positive answer to the question of Bermond and Bollob'as concerning the Degree/Diameter Problem: Given a positive integer , does there exist a pair and , such that
Recommendations
Cites work
- Algebraic Graph Theory
- Dynamic cage survey
- Eigenvalues and expanders
- Existence and explicit constructions of \(q+1\) regular Ramanujan graphs for every prime power \(q\)
- Explicit constructions of graphs without short cycles and low density codes
- Girth, valency, and excess
- scientific article; zbMATH DE number 3525170 (Why is no real title available?)
- scientific article; zbMATH DE number 2042680 (Why is no real title available?)
- scientific article; zbMATH DE number 3794103 (Why is no real title available?)
- scientific article; zbMATH DE number 7378741 (Why is no real title available?)
- Interlacing families. I: Bipartite Ramanujan graphs of all degrees
- Moore graphs and beyond: a survey of the degree/diameter problem
- On Minimal graphs of maximum even girth
- On the defect of vertex-transitive graphs of given degree and diameter
- On the second eigenvalue of a graph
- Ramanujan graphs
- Spectra of regular graphs and hypergraphs and orthogonal polynomials
- The nonexistence of certain generalized polygons
- The second eigenvalue of regular graphs of given girth
Cited in
(4)
This page was built for publication: A connection between a question of Bermond and Bollobás and Ramanujan graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2230812)