The least eigenvalue of graphs whose complements have only two pendent vertices

DOI10.1016/J.AMC.2018.02.048MaRDI QIDQ2333167zbMATH OpenOpenAlexFDO

Authors Gui-Sheng Jiang, Guidong Yu, Zheng Ruan, Wei Sun

Publication date 12 November 2019

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.amc.2018.02.048

zbMATH Keywords

adjacency matrixcomplementleast eigenvaluependent vertex

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Recommendations

• The least eignvalue of the graphs whose complements are connected and have pendant vertices
• The least eigenvalue of graphs with given connectivity
• The least eigenvalue of graphs whose complements are 2-vertex or 2-edge connected
• The least eigenvalue of graphs
• The least eigenvalues of the signless Laplacian of non-bipartite graphs with pendant vertices

Cites work

• A sharp lower bound for the least eigenvalue of the signless Laplacian of a non-bipartite graph
• Bicyclic graphs for which the least eigenvalue is minimum
• Graphs for which the least eigenvalue is minimal. I
• Graphs for which the least eigenvalue is minimal. II.
• Interlacing eigenvalues and graphs
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• Quadratic forms on graphs with application to minimizing the least eigenvalue of signless Laplacian over bicyclic graphs
• The least eigenvalue of a graph with cut vertices
• The least eigenvalue of graphs
• The least eigenvalue of graphs whose complements are 2-vertex or 2-edge connected
• The least eigenvalue of graphs with given connectivity
• The least eigenvalue of the complements of trees
• The least eigenvalue of the signless Laplacian of the complements of trees
• The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph

Cited in

(6)

• On the second minimizing graph in the set of complements of trees
• The least eigenvalue of graphs
• The least eignvalue of the graphs whose complements are connected and have pendant vertices
• The least eigenvalue of graphs whose complements are 2-vertex or 2-edge connected
• The distance spectrum of the complements of graphs of diameter greater than three
• The distance spectrum of the complements of graphs with two pendent vertices

This page was built for publication: The least eigenvalue of graphs whose complements have only two pendent vertices

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