Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 1

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: least eigenvalue

Sortuj według:

Ogranicz wyniki do:

The least eigenvalue of the graphs whose complements are connected and have pendent paths

Wang C., Yu G., Sun W., Cao J.

Journal of Artificial Intelligence and Soft Computing Research

2018

Vol. 8, No. 4

303--308

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.