Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph (Q6094710)

In this paper, the authors are interested in determining how far an eigenvalue $\lambda$ of a signed graph $G^\prime$ can be from the nearest eigenvalue of an induced subgraph $H$. The problem becomes nontrivial when $\lambda$ is not an eigenvalue of $H$. The authors are successful in estimating the distance in terms of eigenvectors and structural parameters related to vertex degrees. From the well-known interlacing theorem, it follows that, if the multiplicity of $\lambda$ in the spectrum of $G^\prime$ is $k$, then it belongs to the spectrum of every induced subgraph obtained by deleting at most $k-1$ vertices. So it is interesting to consider this problem when $H^\prime$ is obtained by deleting $k$ vertices of $G$. The authors also consider the case in which $\lambda$ is a simple eigenvalue of $H^\prime$ but $H^\prime$ is not necessarily a vertex-deleted subgraph. Further, they probe the case when $\lambda$ is the spectral radius of an unsigned graph. They also indicate the scope for further research in detail.