On the least eigenvalue of cacti with pendant vertices
From MaRDI portal
Publication:1938682
DOI10.1016/j.laa.2012.09.029zbMath1258.05077MaRDI QIDQ1938682
Publication date: 22 February 2013
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2012.09.029
05C35: Extremal problems in graph theory
05C38: Paths and cycles
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Further results on the least eigenvalue of connected graphs
- On the least eigenvalue of cacti
- The least eigenvalue of the complements of trees
- On least eigenvalues of bicyclic graphs with fixed number of pendant vertices
- 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.
- Minimizing the least eigenvalue of unicyclic graphs with fixed diameter
- The least eigenvalue of a graph with cut vertices
- The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph
- Bicyclic graphs for which the least eigenvalue is minimum
- The least eigenvalue of graphs with given connectivity
- The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
- Sharp lower bounds of the least eigenvalue of planar graphs
- A surprising property of the least eigenvalue of a graph
- On graphs whose least eigenvalue exceeds \(-1-\sqrt2\)
- The spectral radius of trees on \(k\) pendant vertices
- The largest eigenvalue of a graph: A survey