Classification of graphs by Laplacian eigenvalue distribution and independence number

DOI10.1080/03081087.2022.2124944arXiv2111.12380OpenAlexW3215491534MaRDI QIDQ6140319

Sunyo Moon, Jinwon Choi, Seungkook Park

Publication date: 2 January 2024

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

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

zbMATH Keywords

independence numberLaplacian eigenvalueL-cospectral

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Permanental roots and the star degree of a graph
• Domination number and Laplacian eigenvalue distribution
• One special double starlike graph is determined by its Laplacian spectrum
• Enumeration of cospectral graphs.
• Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution
• Laplacian eigenvalue distribution and graph parameters
• A note on the second largest eigenvalue of the laplacian matrix of a graph^∗
• The Laplacian Spectrum of a Graph
• On the third largest Laplacian eigenvalue of a graph
• The Laplacian Spectrum of a Graph II
• Ordering trees by algebraic connectivity

This page was built for publication: Classification of graphs by Laplacian eigenvalue distribution and independence number