Trees with minimal index and diameter at most four

DOI10.1016/j.disc.2009.11.022zbMath1222.05020OpenAlexW2090784876MaRDI QIDQ973144

Enzo M. Li Marzi, Francesco Belardo, Slobodan K. Simic

Publication date: 28 May 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2009.11.022

zbMATH Keywords

diametertreesgraph eigenvaluesgraph index

Mathematics Subject Classification ID

Trees (05C05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

Spectral Radius of Graphs ⋮ Graph spectra in computer science ⋮ The spectral radius of graphs with given independence number

Cites Work

• Unnamed Item
• Unnamed Item
• The minimal spectral radius of graphs with a given diameter
• Parallel concepts in graph theory
• Some results on the index of unicyclic graphs
• The largest eigenvalue of a graph: A survey