On the third largest eigenvalue of graphs

DOI10.1016/j.laa.2016.03.037zbMath1338.05128OpenAlexW2323720583MaRDI QIDQ277140

Mohammad Reza Oboudi

Publication date: 4 May 2016

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

Full work available at URL: https://doi.org/10.1016/j.laa.2016.03.037

zbMATH Keywords

eigenvalues of graphsspectrum of graphsthird largest eigenvalue of a graph

Mathematics Subject Classification ID

Graph polynomials (05C31) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Related Items

LOWER BOUNDS FOR ENERGY OF MATRICES AND ENERGY OF REGULAR GRAPHS, On the eigenvalues and spectral radius of starlike trees, Cospectrality of multipartite graphs, Energy of graphs with no eigenvalue in the interval \((-1,1)\), Reverse Wiener spectral radius of trees, Spectral conditions for edge connectivity and spanning tree packing number in (multi-)graphs, Edge connectivity, packing spanning trees, and eigenvalues of graphs, A relation between the signless Laplacian spectral radius of complete multipartite graphs and majorization, On the spectral determinations of the connected multicone graphs, Chromatic number and signless Laplacian spectral radius of graphs, A new lower bound for the energy of graphs, Majorization and the spectral radius of starlike trees, On graphs with exactly two positive eigenvalues, Distance spectral radius of complete multipartite graphs and majorization, The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5, A complete characterization of graphs with exactly two positive eigenvalues

Cites Work

• Unnamed Item
• On the third largest eigenvalue of a graph
• The distribution of eigenvalues of graphs
• Cospectrality of complete bipartite graphs
• Bipartite graphs with at most six non-zero eigenvalues
• Characterization of graphs with exactly two non-negative eigenvalues