A lower bound for the spectral radius of graphs with fixed diameter

DOI10.1016/j.ejc.2009.07.007zbMath1217.05139OpenAlexW2151986794MaRDI QIDQ992783

Jack H. Koolen, Jae-Ho Lee, Sebastian M. Cioabă, van Dam, Edwin R.

Publication date: 10 September 2010

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

Full work available at URL: https://research.tilburguniversity.edu/en/publications/98274e8c-2490-4ba3-ad6d-ce645b143756

zbMATH Keywords

graphs with diameter three

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12)

Related Items (6)

The non-bipartite integral graphs with spectral radius three ⋮ A note on spectral radius and degree deviation in graphs ⋮ A new result on spectral radius and maximum degree of irregular graphs ⋮ A note on spectral radius and maximum degree of irregular graphs ⋮ Eigenvalues and triangles in graphs ⋮ The maximum spectral radius of non-bipartite graphs forbidding short odd cycles

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Walks and the spectral radius of graphs
• The minimal spectral radius of graphs with a given diameter
• Asymptotic results on the spectral radius and the diameter of graphs
• Problems in algebraic combinatorics
• The spectral radius and the maximum degree of irregular graphs
• Asymptotically large (\(\Delta,D\))-graphs
• Moore graphs and beyond: a survey of the degree/diameter problem
• Spectral Radius and Degree Sequence
• On a problem of a. kotzig concerning factorizations of 4‐regular graphs

This page was built for publication: A lower bound for the spectral radius of graphs with fixed diameter