The graphs with the least distance eigenvalue at least -1 + 172

DOI10.1016/J.LAA.2015.10.028MaRDI QIDQ905723zbMATH OpenOpenAlexFDO

Authors Dan Li, Jixiang 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

distance matrixcospectralleast distance eigenvalue

Mathematics Subject Classification ID

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

Recommendations

• 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 second least distance eigenvalue of a graph
• On the distance spectrum of graphs
• On the second largest distance eigenvalue of a graph

Cites work

• Bounds on the distance signless Laplacian spectral radius in terms of clique number
• Commutativity and spectra of Hermitian matrices
• Complete multipartite graphs are determined by their distance spectra
• Developments on spectral characterizations of graphs
• On graphs with at least three distance eigenvalues less than \(-1\)
• On the distance spectrum of graphs
• On the least distance eigenvalue and its applications on the distance spread
• On the least distance eigenvalue of a graph
• The inertia and energy of the distance matrix of a connected graph
• Which graphs are determined by their spectrum?

Cited in

(14)

• On the distance spectra of graphs
• The complements of path and cycle are determined by their distance (signless) Laplacian spectra
• On graphs whose third largest distance eigenvalue dose not exceed \(-1\)
• Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
• On the second largest distance eigenvalue of a graph
• On the least distance eigenvalue and its applications on the distance spread
• On the second least distance eigenvalue of a graph
• On the least distance eigenvalue of a graph
• The distance eigenvalues of the complements of unicyclic graphs
• On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs
• The multiplicity of \(-2\) as an eigenvalue of the distance matrix of graphs
• On the distance spectrum of graphs
• The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\)
• Some results on the distance and distance signless Laplacian spectral radius of graphs and digraphs

This page was built for publication: The graphs with the least distance eigenvalue at least \(-\frac{1 + \sqrt{17}}{2}\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q905723)