Graphs with diameter \(n - e\) minimizing the spectral radius

DOI10.1016/j.laa.2012.05.038zbMath1253.05083arXiv1110.2444MaRDI QIDQ1758480

Linyuan Lu, Jingfen Lan, Ling-Sheng Shi

Publication date: 9 November 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.2444

zbMATH Keywords

spectral radius; diameter; characteristic polynomial; adjacency matrix; graphs; largest eigenvalue

Mathematics Subject Classification ID

05C31: Graph polynomials

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

05C12: Distance in graphs

Related Items

Spectral Radius of Graphs, On the divisibility of H-shape trees and their spectral determination, Connected hypergraphs with small spectral radius, Diameters of graphs with spectral radius at most \(\frac{3}{2}\sqrt{2}\), Graphs of order \(n\) and diameter \(2(n-1)/3\) minimizing the spectral radius, Open quipus with the same Wiener index as their quadratic line graph, Unicyclic graphs of minimal spectral radius, Trees with given maximum degree minimizing the spectral radius

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The minimal spectral radius of graphs with a given diameter
• The minimal spectral radius of graphs of order \(n\) with diameter \(n-4\)
• Some notes on graphs whose spectral radius is close to \(\frac{3}{2}\sqrt 2\)
• Asymptotic results on the spectral radius and the diameter of graphs
• The graphs with spectral radius between 2 and \(\sqrt{2+\sqrt{5}}\)
• A new look at the Lanczos algorithm for solving symmetric systems of linear equations
• The Gewirtz graph: An exercise in the theory of graph spectra
• On graphs whose spectral radius is bounded by \(\frac{3}{2}\sqrt{2}\)