Complete signed graphs with largest maximum or smallest minimum eigenvalue (Q6117351)

Several questions about signed graphs with extremal spectral radius have been studied in the literature. A natural question is to identify which signature leads to the minimum spectral radius. Some basic facts on Seidel matrices and threshold graphs are mentioned. The paper deals with signed graphs with extremal eigenvalues of the adjacency matrices of complete signed graphs. The complete signed graphs with maximal index (i.e. the largest eigenvalue) with \(n\) vertices and \(m \leq \lfloor n^2/4\rfloor \) negative edges have been already determined. The authors address the remaining case by characterizing those with \( m < \lfloor n^2/4\rfloor \) negative edges. They also identify the unique signed graph with maximal index among complete signed graphs whose negative edges induce a tree of diameter at least \(d\) for any given \(d\). This extends a recent result by \textit{D. Li} et al. [Discrete Math. 346, No. 2, Article ID 113250, 17 p. (2023; Zbl 1504.05172)] are established the same result for \(d=2\). In the end, the smallest minimum eigenvalue of complete signed graphs with \(n\) vertices whose negative edges induce a tree is \(\sqrt{(n/2)-1}-1 + O( 1/n )\) is proved. The paper has many interesting results on signed graphs. This article is useful to younger researchers working in the discrete structures areas.