- Tytuł:
- The Least Eigenvalue of Graphs whose Complements Are Unicyclic
- Autorzy:
-
Wang, Yi
Fan, Yi-Zheng
Li, Xiao-Xin
Zhang, Fei-Fei - Powiązania:
- https://bibliotekanauki.pl/articles/31339491.pdf
- Data publikacji:
- 2015-05-01
- Wydawca:
- Uniwersytet Zielonogórski. Wydział Matematyki, Informatyki i Ekonometrii
- Tematy:
-
unicyclic graph
complement
adjacency matrix
least eigen- value - Opis:
- 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 $ \mathcal{U}_n^c $ of graphs whose complements are unicyclic), and characterize the unique minimizing graph in $ \mathcal{U}_n^c $ when $ n \ge 20 $.
- Źródło:
-
Discussiones Mathematicae Graph Theory; 2015, 35, 2; 249-260
2083-5892 - Pojawia się w:
- Discussiones Mathematicae Graph Theory
- Dostawca treści:
- Biblioteka Nauki
Artykuł