A connection between a question of Bermond and Bollobás and Ramanujan graphs

From MaRDI portal
(Redirected from Publication:2230812)



Abstract: Let n(k,d) be the order of the largest undirected graphs of maximum degree k and diameter d, and let M(k,d) 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 c>0, does there exist a pair k and d, such that n(k,d)leqM(k,d)−c?












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)