Laplacian eigenvalue distribution and graph parameters

DOI10.1016/j.laa.2021.09.012zbMath1479.05187MaRDI QIDQ2244867

Milad Ahanjideh, M. H. Fakharan, Vilmar Trevisan, Saieed Akbari

Publication date: 12 November 2021

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

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

zbMATH Keywords

inequality; Laplacian spectrum; spectral graph theory

Mathematics Subject Classification ID

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

Related Items

Classification of trees by Laplacian eigenvalue distribution and edge covering number, Proof of a conjecture on distribution of Laplacian eigenvalues and diameter, and beyond, Laplacian eigenvalue distribution of a graph with given independence number

Cites Work

• Unnamed Item
• Unnamed Item
• Domination number and Laplacian eigenvalue distribution
• On graphs having domination number half their order
• Laplacian matrices of graphs: A survey
• A new upper bound for eigenvalues of the Laplacian matrix of a graph
• An improved upper bound for Laplacian graph eigenvalues
• Laplacian distribution and domination
• The Laplacian spectrum of a graph
• Most Laplacian eigenvalues of a tree are small
• Vertex-connectivity, chromatic number, domination number, maximum degree and Laplacian eigenvalue distribution
• On graphs with a single large Laplacian eigenvalue
• The Laplacian Spectrum of a Graph
• The Laplacian Spectrum of a Graph II
• Ordering trees by algebraic connectivity
• Matrix theory. Basic results and techniques
• A relation between the matching number and Laplacian spectrum of a graph