Nordhaus-Gaddum type inequalities for the \(k\)th largest Laplacian eigenvalues
From MaRDI portal
Publication:6197803
DOI10.37236/12008MaRDI QIDQ6197803
Publication date: 19 February 2024
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)
Cites Work
- Unnamed Item
- Unnamed Item
- Nordhaus-Gaddum type inequalities for Laplacian and signless Laplacian eigenvalues
- Graphs with given diameter maximizing the algebraic connectivity
- Spectra of graphs
- On the Laplacian spread of graphs
- Eigenvalue problems of Nordhaus--Gaddum type
- On a conjecture of V. Nikiforov
- Hamiltonian threshold graphs
- Degree maximal graphs are Laplacian integral
- An improved upper bound for Laplacian graph eigenvalues
- A survey of Nordhaus-Gaddum type relations
- On the lower bound of the sum of the algebraic connectivity of a graph and its complement
- Laplacian eigenvalue distribution and graph parameters
- Signless Laplacian eigenvalue problems of Nordhaus-Gaddum type
- Nordhaus-Gaddum type inequalities for the two largest Laplacian eigenvalues
- Proof of a conjecture of V. Nikiforov
- More eigenvalue problems of Nordhaus-Gaddum type
- On the second largest Laplacian eigenvalue of trees
- The Laplacian spread of graphs
- On Complementary Graphs
- Thekth Laplacian eigenvalue of a tree
- A note on the Nordhaus-Gaddum type inequality to the second largest eigenvalue of a graph
- On the Laplacian, signless Laplacian and normalized Laplacian characteristic polynomials of a graph
- On the \(k\)th largest eigenvalue of the Laplacian matrix of a graph
This page was built for publication: Nordhaus-Gaddum type inequalities for the \(k\)th largest Laplacian eigenvalues
