Wyniki wyszukiwania

Sortuj według:

Ogranicz wyniki do:

The Least Eigenvalue of Graphs whose Complements Are Uni- cyclic

100%

Wang Y., Fan Y.-Z., Li X.-X., Zhang F.-F.

Discussiones Mathematicae Graph Theory

2015

tom 35

nr 2

249-260

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.

Ograniczanie wyników

1 Discussiones Mathematicae Graph Theory

1 Fan Y.-Z.

1 Li X.-X.

1 Wang Y.

1 Zhang F.-F.

1 2015

Wyniki wyszukiwania

The Least Eigenvalue of Graphs whose Complements Are Uni- cyclic