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

DOI10.1016/J.LAA.2009.03.016MaRDI QIDQ1030728zbMATH OpenOpenAlexFDO

Authors Rui-fang Liu, Mingqing Zhai, Jinlong 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

least eigenvaluependant verticesunicyclic graph

Mathematics Subject Classification ID

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

Recommendations

• The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with \(K\) pendant vertices
• Minimizing the least eigenvalue of bicyclic graphs with k pendant vertices.
• Minimizing the least eigenvalue of unicyclic graphs with fixed diameter
• Ordering unicyclic graphs in terms of their smaller least eigenvalues
• Ordering non-bipartite unicyclic graphs with pendant vertices by the least \(Q\)-eigenvalue

Cites work

• Graphs for which the least eigenvalue is minimal. I
• Graphs for which the least eigenvalue is minimal. II.
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• 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

Cited in

(23)

• 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 have only two pendent vertices
• The least eigenvalue of graphs whose complements are unicyclic
• 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 eigenvalues of unicyclic graphs.
• Ordering non-bipartite unicyclic graphs with pendant vertices by the least \(Q\)-eigenvalue
• Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
• Minimizing the least eigenvalue of bicyclic graphs with k pendant vertices.
• Bound on the least eigenvalue of a graph with cut vertices
• On the least eigenvalue of cacti
• The least eigenvalue of the complements of trees
• The least eigenvalue of the signless Laplacian of non-bipartite unicyclic graphs with \(K\) pendant vertices
• Minimizing the least eigenvalue of unbalanced signed unicyclic graphs with given girth or pendant vertices
• Ordering unicyclic graphs in terms of their smaller least eigenvalues
• Bounds on the eigenvalues of graphs with cut vertices or edges
• On least eigenvalues of bicyclic graphs with fixed number of pendant vertices
• The Li-Feng transformation of weighted adjacency matrices for graphs with degree-based edge-weights
• 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

This page was built for publication: The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1030728)