Mixed graphs whose Hermitian adjacency matrices of the second kind have the smallest eigenvalue greater than \(- \frac{3}{2}\) (Q6080566)

In this paper, the authors give the characterization of mixed graphs (graphs some of whose edges are directed) having the smallest eigenvalue of the Hermitian adjacency matrix greater than \(-\frac{3}{2}\). They first classify the mixed graphs with the smallest eigenvalue greater than or equal to \(-\sqrt{2}\) using the interlacing theorem. Then, they characterize the mixed graphs with the smallest eigenvalue greater than \(-\frac{3}{2}\), by showing that those graphs must have an equitable vertex partition of size 3 and calculating the characteristic function of the quotient matrix. This is an interesting continuation of the classification problem of graphs with respect to their spectra.