On graphs with at least three distance eigenvalues less than \(-1\)

DOI10.1016/j.laa.2014.06.040zbMath1296.05123OpenAlexW2089005770MaRDI QIDQ2250948

Shi-Cai Gong, Huiqiu Lin, Ming-qing Zhai

Publication date: 22 July 2014

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

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

zbMATH Keywords

distance spectral radiusdistance spectrasecond smallest \(D\)-eigenvalue

Mathematics Subject Classification ID

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

Related Items (15)

Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\) ⋮ Proximity, remoteness and distance eigenvalues of a graph ⋮ Unnamed Item ⋮ On the eigenvalues of eccentricity matrix of graphs ⋮ The distance eigenvalues of the complements of unicyclic graphs ⋮ On the least distance eigenvalue and its applications on the distance spread ⋮ Spectral gap of the largest eigenvalue of the normalized graph Laplacian ⋮ Extremal normalized Laplacian spectral radii of graphs ⋮ The graphs with the least distance eigenvalue at least \(-\frac{1 + \sqrt{17}}{2}\) ⋮ 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 graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\) ⋮ The complements of path and cycle are determined by their distance (signless) Laplacian spectra ⋮ On the distance and distance Laplacian eigenvalues of graphs ⋮ The multiplicity of -2 as an eigenvalue of the distance matrix of graphs

Cites Work

• Distance spectral radius of digraphs with given connectivity
• On the distance spectral radius of some graphs
• Distance spectral radius of trees with given matching number
• Some graft transformations and its application on a distance spectrum
• Sharp bounds on the distance spectral radius and the distance energy of graphs
• On the least distance eigenvalue of a graph
• Complete multipartite graphs are determined by their distance spectra
• On the distance spectrum of graphs
• The distance spectrum of a tree
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On graphs with at least three distance eigenvalues less than \(-1\)