On the second largest distance eigenvalue of a graph
From MaRDI portal
Publication:2979480
DOI10.1080/03081087.2016.1221376zbMath1360.05099arXiv1504.04225OpenAlexW1690774857MaRDI QIDQ2979480
Litao Guo, Jie Xue, Rui-fang Liu
Publication date: 25 April 2017
Published in: Linear and Multilinear Algebra (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1504.04225
Related Items (6)
Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph ⋮ Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\) ⋮ On the second largest distance eigenvalue of a block graph ⋮ Quadratic embedding constants of graph joins ⋮ Unnamed Item ⋮ The complements of path and cycle are determined by their distance (signless) Laplacian spectra
Cites Work
- Cospectral graphs and the generalized adjacency matrix
- The graphs with the least distance eigenvalue at least \(-\frac{1 + \sqrt{17}}{2}\)
- Developments on spectral characterizations of graphs
- Which graphs are determined by their spectrum?
- On graphs with at least three distance eigenvalues less than \(-1\)
- On the least distance eigenvalue and its applications on the distance spread
- Complete multipartite graphs are determined by their distance spectra
- On the distance spectrum of graphs
- On the second largest distance eigenvalue
This page was built for publication: On the second largest distance eigenvalue of a graph
