The least eigenvalue of graphs whose complements are unicyclic

DOI10.7151/dmgt.1796zbMath1311.05119arXiv1305.4317OpenAlexW2593244558MaRDI QIDQ2344012

Xiao-Xin Li, Yi Wang, Fei-Fei Zhang, Yi-Zheng Fan

Publication date: 11 May 2015

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1305.4317

zbMATH Keywords

adjacency matrixunicyclic graphleast eigenvaluecomplement

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Connectivity (05C40)

Related Items (5)

Characterization of the minimizing graph of the connected graphs whose complements are bicyclic ⋮ On the second minimizing graph in the set of complements of trees ⋮ Minimizing graph of the connected graphs whose complements are bicyclic with two cycles ⋮ Graphs with least eigenvalue \(-2\): ten years on ⋮ Least eigenvalue of the connected graphs whose complements are cacti

Cites Work

• Further results on the least eigenvalue of connected graphs
• The least eigenvalue of the complements of trees
• 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.
• 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
• Bicyclic graphs for which the least eigenvalue is minimum
• The least eigenvalue of graphs with given connectivity
• The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• Sharp lower bounds of the least eigenvalue of planar graphs
• The largest eigenvalue of a graph: A survey
• Unnamed Item
• Unnamed Item

This page was built for publication: The least eigenvalue of graphs whose complements are unicyclic