Diameter vs. Laplacian eigenvalue distribution
For a graph \(G\) of order \(n\), any Laplacian eigenvalue of \(G\) lies in the interval [0, \(n\)]. For an interval \(I\subseteq [0, n]\), denote by \(m_{G}I\) the number of Laplacian eigenvalues of \(G\) in \(I\), counted with multiplicities. Let \(d\) be the diameter of \(G\). For \(2\leq d \leq n-4\), the authors show that \(m_G[n-d, n]\leq n-d+2\), and it may be improved into \(m_G[n-d, n]\leq n-d+1\) when \(d = 2, 3, 4\). It is also shown that \(m_G[n-2d+4, n]\leq n-2\) if \(d = 2, \lfloor (n+3)/2\rfloor\) and \(m_G[n-2d+4, n]\leq n-3\) if \(3\leq d \leq \lfloor (n+1)/2\rfloor\).
- A note on the second largest eigenvalue of the laplacian matrix of a graph∗
- A relation between the matching number and Laplacian spectrum of a graph
- Classification of graphs by Laplacian eigenvalue distribution and independence number
- Commutativity and spectra of Hermitian matrices
- Das asymptotische Verteilungsgesetz der Eigenwerte linearer partieller Differentialgleichungen (mit einer Anwendung auf die Theorie der Hohlraumstrahlung).
- Domination number and Laplacian eigenvalue distribution
- Eigenvalues of the Laplacian of a graph∗
- Graph theory
- Honeycombs and sums of Hermitian matrices.
- scientific article; zbMATH DE number 867649 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Laplace eigenvalues of graphs---a survey
- Laplacian distribution and domination
- Laplacian eigenvalue distribution and diameter of graphs
- Laplacian eigenvalue distribution and graph parameters
- Laplacian eigenvalue distribution of a graph with given independence number
- Laplacian matrices of graphs: A survey
- Most Laplacian eigenvalues of a tree are small
- On graphs with equal algebraic and vertex connectivity
- 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
- Proof of a conjecture on distribution of Laplacian eigenvalues and diameter, and beyond
- The Laplacian Spectrum of a Graph
- The Laplacian Spectrum of a Graph II
- Two Necessary Conditions for λ 2 (G) = d 2 ( G )
This page was built for publication: Diameter vs. Laplacian eigenvalue distribution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6908599)
