Non-bipartite graphs with third largest Laplacian eigenvalue less than three

DOI10.1007/s10114-005-0747-6zbMath1102.05040OpenAlexW1968322091MaRDI QIDQ2508614

Rong Luo, Xiao Dong Zhang

Publication date: 13 October 2006

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10114-005-0747-6

zbMATH Keywords

spectral graph theoryforbidden subgraph

Mathematics Subject Classification ID

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

Related Items (4)

Laplacian eigenvalue distribution of a graph with given independence number ⋮ On the distribution of Laplacian eigenvalues of a graph ⋮ Graphs with small second largest Laplacian eigenvalue ⋮ On edge singularity and eigenvectors of mixed graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Laplacian matrices of graphs: A survey
• Graphs with fourth Laplacian eigenvalue less than two
• Bipartite graphs with small third Laplacian eigenvalue.
• Upper bound for the Laplacian graph eigenvalues
• Spectral radius of non-negative matrices and digraphs
• Bounds for the least Laplacian eigenvalue of a signed graph
• The Laplacian Spectrum of a Graph
• 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

This page was built for publication: Non-bipartite graphs with third largest Laplacian eigenvalue less than three