The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
From MaRDI portal
Publication:1030728
DOI10.1016/j.laa.2009.03.016zbMath1169.05349OpenAlexW2068589081MaRDI QIDQ1030728
Rui-fang Liu, Ming-qing Zhai, Jin-Long Shu
Publication date: 2 July 2009
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.laa.2009.03.016
Related Items (16)
Characterization of the minimizing graph of the connected graphs whose complements are bicyclic ⋮ An edge-rotating theorem on the least eigenvalue of graphs ⋮ The least eigenvalue of graphs with cut edges ⋮ On the least eigenvalue of cacti with pendant vertices ⋮ Bounds on the eigenvalues of graphs with cut vertices or edges ⋮ Minimizing the least eigenvalue of unbalanced signed unicyclic graphs with given girth or pendant vertices ⋮ Minimizing graph of the connected graphs whose complements are bicyclic with two cycles ⋮ On least eigenvalues of bicyclic graphs with fixed number of pendant vertices ⋮ The least eigenvalue of a graph with a given domination number ⋮ Bound on the least eigenvalue of a graph with cut vertices ⋮ The least eigenvalue of a graph with cut vertices ⋮ On the least eigenvalue of cacti ⋮ The least eigenvalue of the complements of trees ⋮ The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph ⋮ The least eigenvalue of graphs whose complements have only two pendent vertices ⋮ The least eigenvalue of graphs whose complements are unicyclic
Cites Work
- Unnamed Item
- 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.
- Sharp lower bounds of the least eigenvalue of planar graphs
- The spectral radius of trees on \(k\) pendant vertices
- The spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices
This page was built for publication: The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices