On graphs whose third largest distance eigenvalue dose not exceed \(-1\)
From MaRDI portal
Publication:2242780
DOI10.1016/j.amc.2021.126137MaRDI QIDQ2242780
Jie Xue, Jin-Long Shu, Rui-fang Liu
Publication date: 10 November 2021
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2021.126137
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Some new considerations about double nested graphs
- On bounds for the index of double nested graphs
- On the first eigenvalue of bipartite graphs
- On the second largest distance eigenvalue of a block graph
- On a property of the class of n-colorable graphs
- On the distance spectrum of graphs
- Inverse of the distance matrix of a block graph
- On the distance spectrum of trees
- On the second largest distance eigenvalue