Back to Search
Start Over
The Least Eigenvalue of Graphs whose Complements Are Uni- cyclic.
- Source :
-
Discussiones Mathematicae: Graph Theory . 2015, Vol. 35 Issue 2, p249-260. 12p. - Publication Year :
- 2015
-
Abstract
- A graph in a certain graph class is called minimizing if the least eigenvalue of its adjacency matrix attains the minimum among all graphs in that class. Bell et al. have identified a subclass within the connected graphs of order n and size m in which minimizing graphs belong (the complements of such graphs are either disconnected or contain a clique of size 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 class Ucn of graphs whose complements are unicyclic), and characterize the unique minimizing graph in Ucn when n ≥ 20. [ABSTRACT FROM AUTHOR]
- Subjects :
- *EIGENVALUES
*GRAPH theory
*SET theory
*GRAPH connectivity
*MATHEMATICAL analysis
Subjects
Details
- Language :
- English
- ISSN :
- 12343099
- Volume :
- 35
- Issue :
- 2
- Database :
- Academic Search Index
- Journal :
- Discussiones Mathematicae: Graph Theory
- Publication Type :
- Academic Journal
- Accession number :
- 102726616
- Full Text :
- https://doi.org/10.7151/dmgt.1796