Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph
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.
- Controllability of multi-agent systems from a graph-theoretic perspective
- Distance between distance spectra of graphs
- Eigenvalue distribution of large random matrices
- Eigenvectors and eigenvalues of non-regular graphs
- Inequalities for Graph Eigenvalues
- Locating eigenvalues in graphs. Algorithms and applications
- Matrices in the theory of signed simple graphs
- Note on deleting a vertex and weak interlacing of the Laplacian spectrum
- On adjacency and Laplacian cospectral non-isomorphic signed graphs
- On cospectral oriented graphs and cospectral signed graphs
- On least eigenvalues and least eigenvectors of real symmetric matrices and graphs
- Principal eigenvectors of irregular graphs
- Principal submatrices of normal and Hermitian matrices
- Random matrices: universality of local eigenvalue statistics
- Research problems from the Aveiro workshop on graph spectra
- Revisiting two classical results on graph spectra
- Spectra of signed graphs with two eigenvalues
- Spectral distances of graphs
- Spectral distances of graphs based on their different matrix representations
- Spectral distances on graphs
- Total graph of a signed graph
This page was built for publication: Estimating distance between an eigenvalue of a signed graph and the spectrum of an induced subgraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6094710)
