The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices

DOI10.1016/j.laa.2009.03.016zbMath1169.05349MaRDI 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

zbMATH Keywords

unicyclic graph; pendant vertices; least eigenvalue

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

Related Items

Bound on the least eigenvalue of a graph with cut vertices, An edge-rotating theorem on the least eigenvalue of graphs, On the least eigenvalue of cacti, The least eigenvalue of the complements of trees, Bounds on the eigenvalues of graphs with cut vertices or edges, On least eigenvalues of bicyclic graphs with fixed number of pendant vertices, 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, The least eigenvalue of a graph with a given domination number, The least eigenvalue of graphs with cut edges, On the least eigenvalue of cacti with pendant vertices, The least eigenvalue of graphs whose complements are unicyclic, Characterization of the minimizing graph of the connected graphs whose complements are bicyclic

Cites Work

• 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
• Unnamed Item