The least eigenvalue of the complements of graphs with given connectivity
arXiv:2305.17143
Abstract
The least eigenvalue of a graph is the least eigenvalue of adjacency matrix of . In this paper we determine the graphs which attain the minimum least eigenvalue among all complements of connected simple graphs with given connectivity.
10 pages. arXiv admin note: substantial text overlap with arXiv:2209.05694