Some bounds on the largest eigenvalues of graphs

DOI10.1016/j.aml.2011.09.009zbMath1243.05152OpenAlexW1984754547MaRDI QIDQ427601

Shuchao Li, Yi Tian

Publication date: 14 June 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.aml.2011.09.009

zbMATH Keywords

signless Laplacian indexmaximum and minimum degreeadjacency indexLaplacian index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Determinants, permanents, traces, other special matrix functions (15A15) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex degrees (05C07)

Related Items

A quantum searching model finding one of the edges of a subgraph in a complete graph

Cites Work

• Unnamed Item
• Unnamed Item
• On the two largest \(Q\)-eigenvalues of graphs
• Bounds on the (Laplacian) spectral radius of graphs
• Signless Laplacians of finite graphs
• Towards a spectral theory of graphs based on the signless Laplacian. II.
• Sharp bounds for the largest eigenvalue of the signless Laplacian of a graph
• A bound on the spectral radius of graphs
• Laplacian matrices of graphs: A survey
• Which graphs are determined by their spectrum?
• On the Laplacian spectral radius of a graph
• A bound on the spectral radius of graphs with \(e\) edges
• The largest eigenvalue of nonregular graphs
• Eigenvalue bounds for the signless laplacian
• Towards a spectral theory of graphs based on the signless Laplacian, I
• Eigenvalues of the Laplacian of a graph^∗
• Eigenvectors of acyclic matrices
• Towards a spectral theory of graphs based on the signless Laplacian, III

This page was built for publication: Some bounds on the largest eigenvalues of graphs