The least eigenvalue of the complements of graphs with given connectivity

Huan Qiu, Keng Li, Guoping Wang

Published: 2023/5/25

Abstract

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.

The least eigenvalue of the complements of graphs with given connectivity | SummarXiv | SummarXiv