The least eigenvalue of a graph G is the least eigenvalue of adjacency matrix of G. In this paper we determine the graphs which attain the minimum least eigenvalue among all complements of connected simple graphs with given connectivity.
@article{arxiv.2305.17143,
title = {The least eigenvalue of the complements of graphs with given connectivity},
author = {Huan Qiu and Keng Li and Guoping Wang},
journal= {arXiv preprint arXiv:2305.17143},
year = {2025}
}
Comments
10 pages. arXiv admin note: substantial text overlap with arXiv:2209.05694