The graphs with the least distance eigenvalue at least \(-\frac{1 + \sqrt{17}}{2}\)

DOI10.1016/j.laa.2015.10.028zbMath1329.05193OpenAlexW2508778148MaRDI QIDQ905723

Dan Li, Ji Xiang Meng

Publication date: 28 January 2016

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2015.10.028

zbMATH Keywords

cospectraldistance matrixleast distance eigenvalue

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Connectivity (05C40)

Related Items

Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\) ⋮ The distance eigenvalues of the complements of unicyclic graphs ⋮ On the second largest distance eigenvalue of a graph ⋮ Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs ⋮ The complements of path and cycle are determined by their distance (signless) Laplacian spectra

Cites Work

• The inertia and energy of the distance matrix of a connected graph
• Developments on spectral characterizations of graphs
• Commutativity and spectra of Hermitian matrices
• 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
• On the least distance eigenvalue of a graph
• Complete multipartite graphs are determined by their distance spectra
• On the distance spectrum of graphs
• Bounds on the distance signless Laplacian spectral radius in terms of clique number