- Tytuł:
- The least eigenvalue of the graphs whose complements are connected and have pendent paths
- Autorzy:
-
Wang, C.
Yu, G.
Sun, W.
Cao, J. - Powiązania:
- https://bibliotekanauki.pl/articles/91753.pdf
- Data publikacji:
- 2018
- Wydawca:
- Społeczna Akademia Nauk w Łodzi. Polskie Towarzystwo Sieci Neuronowych
- Tematy:
-
graph
complement
pendent path
adjacency matrix
least eigenvalue - Opis:
- The adjacency matrix of a graph is a matrix which represents adjacent relation between the vertices of the graph. Its minimum eigenvalue is defined as the least eigenvalue of the graph. Let Gn be the set of the graphs of order n, whose complements are connected and have pendent paths. This paper investigates the least eigenvalue of the graphs and characterizes the unique graph which has the minimum least eigenvalue in Gn.
- Źródło:
-
Journal of Artificial Intelligence and Soft Computing Research; 2018, 8, 4; 303-308
2083-2567
2449-6499 - Pojawia się w:
- Journal of Artificial Intelligence and Soft Computing Research
- Dostawca treści:
- Biblioteka Nauki
Artykuł