Proof of a conjecture on distribution of Laplacian eigenvalues and diameter, and beyond
From MaRDI portal
(Redirected from Publication:6083985)
Abstract: Ahanjideh, Akbari, Fakharan and Trevisan proposed a conjecture in [Linear Algebra Appl. 632 (2022) 1--14] on the distribution of the Laplacian eigenvalues of graphs: for any connected graph of order with diameter that is not a path, the number of Laplacian eigenvalues in the interval is at most . We show that the conjecture is true, and give a complete characterization of graphs for which the conjectured bound is attained. This establishes an interesting relation between the spectral and classical parameters.
Recommendations
- On a conjecture for the sum of Laplacian eigenvalues
- A proof of a conjecture on the distance spectral radius
- On the distribution of Laplacian eigenvalues of a graph
- scientific article; zbMATH DE number 4201229
- Distribution of Laplacian eigenvalues of graphs
- Some results on the Laplacian spread conjecture
- On the Asymptotic Distribution of Eigenvalues
- Domination number and Laplacian eigenvalue distribution
- A new result on the pinching of the first eigenvalue of the Laplacian and the Dirichlet diameter conjecture
- On the multiplicities of distance Laplacian eigenvalues
Cites work
- A relation between the matching number and Laplacian spectrum of a graph
- Commutativity and spectra of Hermitian matrices
- Domination number and Laplacian eigenvalue distribution
- Eigenvalues of the Laplacian of a graph∗
- Honeycombs and sums of Hermitian matrices.
- scientific article; zbMATH DE number 4208111 (Why is no real title available?)
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- Laplace eigenvalues of graphs---a survey
- Laplacian distribution and domination
- Laplacian eigenvalue distribution and graph parameters
- Laplacian energy of diameter 3 trees
- Laplacian matrices of graphs: A survey
- Most Laplacian eigenvalues of a tree are small
- On the distribution of Laplacian eigenvalues of a graph
- On the distribution of Laplacian eigenvalues of trees
- On the number of Laplacian eigenvalues of trees less than the average degree
- On the number of Laplacian eigenvalues of trees smaller than two
- The Laplacian Spectrum of a Graph
- The Laplacian Spectrum of a Graph II
Cited in
(8)- Laplacian eigenvalue distribution and diameter of graphs
- Distribution of signless Laplacian eigenvalues and graph invariants
- Classification of graphs of order n with a Laplacian eigenvalue of multiplicity n - 2
- On the second largest Laplacian eigenvalue of trees
- Diameter vs. Laplacian eigenvalue distribution
- Laplacian eigenvalue distribution in terms of degree sequence
- Laplacian eigenvalue distribution and girth of graphs
- Graphs with large gaps in their Laplacian spectra
This page was built for publication: Proof of a conjecture on distribution of Laplacian eigenvalues and diameter, and beyond
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6083985)