The least eigenvalue of graphs whose complements are unicyclic

DOI10.7151/DMGT.1796MaRDI QIDQ2344012zbMATH OpenOpenAlexFDO

Authors Yi Wang, Xiaoxin Li, Yizheng Fan, Fei-Fei Zhang

Publication date 11 May 2015

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

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

zbMATH Keywords

adjacency matrixcomplementleast eigenvalueunicyclic graph

Mathematics Subject Classification ID

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

Abstract: A graph in a certain graph class is called minimizing if the least eigenvalue of the adjacency matrix of the graph attains the minimum among all graphs in that class. Bell {it et al.} have characterized the minimizing graphs in the class of connected graphs of order $n$ and size $m$, whose complements are either disconnected or contain a clique of order at least $n/2$. In this paper we discuss the minimizing graphs of a special class of graphs of order $n$ whose complements are connected and contains exactly one cycle (namely the the class $mathscr{U}_n^c$ of graphs whose complements are unicyclic), and characterize the unique minimizing graph in $mathscr{U}_n^c$ when $ngeq20$.

Recommendations

• Characterization of the minimizing graph of the connected graphs whose complements are bicyclic
• Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
• The least signless Laplacian eignvalue of the complements of unicyclic graphs
• The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
• Ordering unicyclic graphs in terms of their smaller least eigenvalues

Cites work

• Bicyclic graphs for which the least eigenvalue is minimum
• 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 2117218 (Why is no real title available?)
• Minimizing the least eigenvalues of unicyclic graphs with application to spectral spread
• On the least eigenvalue of graphs with cut vertices
• 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 vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph

Cited in

(10)

• The least signless Laplacian eignvalue of the complements of unicyclic graphs
• Least eigenvalue of the connected graphs whose complements are cacti
• On the second minimizing graph in the set of complements of trees
• Characterization of the minimizing graph of the connected graphs whose complements are bicyclic
• The least eigenvalues of unicyclic graphs.
• Minimizing graph of the connected graphs whose complements are bicyclic with two cycles
• Graphs with least eigenvalue -2: ten years on
• Maximizing the least Q-eigenvalue of a unicyclic graph with perfect matchings
• The least eigenvalues of integral circulant graphs
• Minimizing the least eigenvalue of unicyclic graphs with fixed diameter

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

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