Laplacian eigenvalue distribution of a graph with given independence number
From MaRDI portal
Publication:2698249
DOI10.1016/j.amc.2023.127943OpenAlexW4323311000MaRDI QIDQ2698249
Jinwon Choi, Jooyeon Park, Suil O, Zhi-Wen Wang
Publication date: 21 April 2023
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2023.127943
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- Unnamed Item
- Bipartite graphs with small third Laplacian eigenvalue.
- Sharp lower bounds on the Laplacian eigenvalues of trees
- On the second largest Laplacian eigenvalues of graphs
- The spectral radius of graphs with given independence number
- On the spectral radius of bi-block graphs with given independence number \(\alpha\)
- Laplacian eigenvalue distribution and graph parameters
- Non-bipartite graphs with third largest Laplacian eigenvalue less than three
- On the third largest Laplacian eigenvalue of a graph