The distance spectrum of the complements of graphs of diameter greater than three

Abstract

Suppose G is a connected simple graph with the vertex set, where eigenvalue λ n (G) is called the least distance eigenvalue of G. In this paper we determine the unique graph whose least distance eigenvalue attains maximum among all complements of graphs of diameter greater than three.