Currently displaying 1 – 2 of 2

Showing per page

Order by Relevance | Title | Year of publication

The Least Eigenvalue of Graphs whose Complements Are Uni- cyclic

Yi WangYi-Zheng FanXiao-Xin LiFei-Fei Zhang — 2015

Discussiones Mathematicae Graph Theory

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...

Page 1

Download Results (CSV)