On the least eigenvalue of cacti with pendant vertices

DOI10.1016/J.LAA.2012.09.029MaRDI QIDQ1938682zbMATH OpenOpenAlexFDO

Authors Rundan Xing, Bo Zhou

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

zbMATH Keywords

cactusleast eigenvalueleast eigenvectorpendant vertex

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Recommendations

• On the least eigenvalue of cacti
• The least eignvalue of the graphs whose complements are connected and have pendant vertices
• On the spectral radius of cacti with \(k\)-pendant vertices
• On the distance spectral radius of cacti
• On the signless Laplacian index of cacti with a given number of pendant vertices

Cites work

• A surprising property of the least eigenvalue of a graph
• Bicyclic graphs for which the least eigenvalue is minimum
• Eigenspaces of graphs
• Further results on the least eigenvalue of connected graphs
• Graphs for which the least eigenvalue is minimal. I
• Graphs for which the least eigenvalue is minimal. II.
• scientific article; zbMATH DE number 3482387 (Why is no real title available?)
• scientific article; zbMATH DE number 3512165 (Why is no real title available?)
• scientific article; zbMATH DE number 740754 (Why is no real title available?)
• Minimizing the least eigenvalue of unicyclic graphs with fixed diameter
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• On graphs whose least eigenvalue exceeds -1-2
• On least eigenvalues of bicyclic graphs with fixed number of pendant vertices
• On the least eigenvalue of cacti
• Sharp lower bounds of the least eigenvalue of planar graphs
• The largest eigenvalue of a graph: A survey
• The least eigenvalue of a graph with cut vertices
• The least eigenvalue of graphs with given connectivity
• The least eigenvalue of the complements of trees
• The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• The spectral radius of trees on \(k\) pendant vertices
• The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph

Cited in

(4)

• Cacti whose spread is maximal
• Sharp upper bounds of A_\alpha-spectral radius of cacti with given pendant vertices
• On the least eigenvalue of cacti
• The least eigenvalues of integral circulant graphs

This page was built for publication: On the least eigenvalue of cacti with pendant vertices

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