Abstract：Suppose that G is a connected simple graph with the vertex set V(G)＝{v1，v2，…，vn}. Then the adjacency matrix of G is A(G)＝(aij)n×n， where aij＝1 if vi is adjacent to vj， and otherwise aij＝0. Since A(G) is real and symmetric， its eigenvalues can be arranged as λ1(G)≥λ2(G)≥…≥λn(G)， and the eigenvalues of A(G) are also called the eigenvalues of G. In this paper， the unique graph on n≥28 vertices whose least eigenvalue is minimum among the complements of all graphs having exactly three pendent vertices is determined.
冯小芸,陈 旭,王国平. 仅有三个悬挂点的图的补图的最小特征值[J]. 华中师范大学学报(自然科学版), 2021, 55(6): 1000-1006.
FENG Xiaoyun,CHEN Xu,WANG Guoping. The least eigenvalue of the complements of graphs having exactly three pendent vertices. journal1, 2021, 55(6): 1000-1006.
2021, Vol. 55 
