On the least distance eigenvalue of a graph
From MaRDI portal
Publication:2435398
DOI10.1016/j.laa.2013.06.029zbMath1282.05161OpenAlexW2053434888MaRDI QIDQ2435398
Publication date: 19 February 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.2013.06.029
Related Items (23)
On the distance spread of cacti and bicyclic graphs ⋮ Graphs with at most three distance eigenvalues different from \(-1\) and \(-2\) ⋮ The distance eigenvalues of the complements of unicyclic graphs ⋮ On the least distance eigenvalue and its applications on the distance spread ⋮ The eccentricity spread of weak-friendship graphs ⋮ The distance spectrum of the complements of graphs of diameter greater than three ⋮ The distance spectrum of the complements of graphs with two pendent vertices ⋮ Distance signless Laplacian spectrum of a graph ⋮ The graphs with the least distance eigenvalue at least \(-\frac{1 + \sqrt{17}}{2}\) ⋮ On least distance eigenvalues of trees, unicyclic graphs and bicyclic graphs ⋮ Unnamed Item ⋮ On least distance eigenvalue of uniform hypergraphs ⋮ New bounds on the distance Laplacian and distance signless Laplacian spectral radii ⋮ The graphs with exactly two distance eigenvalues different from \(-1\) and \(-3\) ⋮ Distance spectra of graphs: a survey ⋮ On graphs with at least three distance eigenvalues less than \(-1\) ⋮ On the second largest distance eigenvalue ⋮ Proof for four conjectures about the distance Laplacian and distance signless Laplacian eigenvalues of a graph ⋮ The distance spectrum of complements of trees ⋮ On the least distance eigenvalues of the second power of a graph ⋮ Unnamed Item ⋮ Extremal spectral results related to spanning trees of signed complete graphs ⋮ On the distance spectrum of distance regular graphs
Cites Work
- Unnamed Item
- The smallest eigenvalue of the signless Laplacian
- Distance spectral radius of trees with given matching number
- The distance spectrum and energy of the compositions of regular graphs
- Graphs for which the least eigenvalue is minimal. I
- Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
- Graphs for which the least eigenvalue is minimal. II.
- A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
- Distance spectral radius of trees with fixed maximum degree
- On Distance Spectral Radius and Distance Energy of Graphs
This page was built for publication: On the least distance eigenvalue of a graph