On the second largest distance eigenvalue of a graph

DOI10.1080/03081087.2016.1221376zbMath1360.05099arXiv1504.04225MaRDI 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

zbMATH Keywords

distance matrix; the second largest distance eigenvalue; \(D\)-spectrum determined

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C12: Distance in graphs

Related Items

Unnamed Item, Remoteness and distance, distance (signless) Laplacian eigenvalues of a graph, Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\), The complements of path and cycle are determined by their distance (signless) Laplacian spectra, On the second largest distance eigenvalue of a block graph, Quadratic embedding constants of graph joins

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