The graphs with the least distance eigenvalue at least -1 + 172
From MaRDI portal
Publication:905723
DOI10.1016/J.LAA.2015.10.028zbMATH Open1329.05193OpenAlexW2508778148MaRDI QIDQ905723FDOQ905723
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
Recommendations
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Distance in graphs (05C12) Connectivity (05C40)
Cites Work
- Developments on spectral characterizations of graphs
- Which graphs are determined by their spectrum?
- On the least distance eigenvalue and its applications on the distance spread
- Commutativity and spectra of Hermitian matrices
- On the least distance eigenvalue of a graph
- Bounds on the distance signless Laplacian spectral radius in terms of clique number
- Complete multipartite graphs are determined by their distance spectra
- On the distance spectrum of graphs
- On graphs with at least three distance eigenvalues less than \(-1\)
- The inertia and energy of the distance matrix of a connected graph
Cited In (5)
- The complements of path and cycle are determined by their distance (signless) Laplacian spectra
- Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\)
- On the second largest distance eigenvalue of a graph
- The distance eigenvalues of the complements of unicyclic graphs
- 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)
