Graphs with fourth Laplacian eigenvalue less than two

DOI10.1016/S0195-6698(03)00069-6zbMath1028.05064MaRDI QIDQ1404994

Xiao Dong Zhang

Publication date: 25 August 2003

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

zbMATH Keywords

Laplacian eigenvaluesLaplacian matrixEigenvalues of graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Structural characterization of families of graphs (05C75)

Related Items

Nonsingular mixed graphs with few eigenvalues greater than two ⋮ On graphs with exactly three \(Q\)-eigenvalues at least two ⋮ Graphs with small second largest Laplacian eigenvalue ⋮ Signless Laplacian eigenvalues and circumference of graphs ⋮ Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution ⋮ Non-bipartite graphs with third largest Laplacian eigenvalue less than three

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Laplacian matrices of graphs: A survey
• Graphs with constant \(\mu\) and \(\overline{\mu}\)
• The Laplacian Spectrum of a Graph
• On the second largest eigenvalue of line graphs
• On bipartite graphs with small number of laplacian eigenvalues greater than two and three
• A relation between the matching number and Laplacian spectrum of a graph