| Autor: |
Wang Yi, Fan Yi-Zheng, Li Xiao-Xin, Zhang Fei-Fei |
| Jazyk: |
angličtina |
| Rok vydání: |
2015 |
| Předmět: |
|
| Zdroj: |
Discussiones Mathematicae Graph Theory, Vol 35, Iss 2, Pp 249-260 (2015) |
| Druh dokumentu: |
article |
| ISSN: |
2083-5892 |
| DOI: |
10.7151/dmgt.1796 |
| Popis: |
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. |
| Databáze: |
Directory of Open Access Journals |
| Externí odkaz: |
|
