The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph
From MaRDI portal
Publication:2144236
Abstract: The inverse eigenvalue problem of a graph studies the real symmetric matrices whose off-diagonal pattern is prescribed by the adjacencies of the graph. The strong spectral property (SSP) is an important tool for this problem. This note establishes the bifurcation lemma, which states that if a spectrum can be realized by a matrix with the SSP for some graph, then all the nearby spectra can also be realized by matrices with the SSP for the same graph. The idea of the bifurcation lemma also works for other strong properties and for not necessarily symmetric matrices. This is used to develop new techniques for verifying a spectrally arbitrary pattern or inertially arbitrary pattern. The bifurcation lemma provides a unified theoretical foundation for several known results, such as the stable northeast lemma and the nilpotent-centralizer method.
Recommendations
- On graphs with strong anti-reciprocal eigenvalue property
- Self-inverse unicyclic graphs and strong reciprocal eigenvalue property
- The inverse eigenvalue problem of a graph: multiplicities and minors
- On the pseudo-inverse of the Laplacian of a bipartite graph
- Strong reciprocal eigenvalue property of a class of weighted graphs
- The inverse eigenvalue problem of a graph
- The strong spectral property for graphs
- On eigenvalue inequalities of a matrix whose graph is bipartite
- Spectral graph theory and the inverse eigenvalue problem of a graph
- Spectral graph theory and the inverse eigenvalue problem of a graph
Cites work
- scientific article; zbMATH DE number 475583 (Why is no real title available?)
- Analysis and algebra on differentiable manifolds: a workbook for students and teachers
- Extreme nonnegative matrices
- Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
- Generating potentially nilpotent full sign patterns
- Matrix Analysis
- Nilpotent matrices and spectrally arbitrary sign patterns
- ON MATRICES DEPENDING ON PARAMETERS
- On the Eigenvalues and Eigenvectors of a Class of Matrices
- Potentially nilpotent patterns and the nilpotent-Jacobian method
- Spectral multiplicity and splitting results for a class of qualitative matrices
- Spectrally arbitrary patterns
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- The Construction of Jacobi and Periodic Jacobi Matrices With Prescribed Spectra
- The inertia set of a signed graph
- The inverse eigenvalue problem of a graph: multiplicities and minors
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample
- The nilpotent-centralizer method for spectrally arbitrary patterns
Cited in
(5)- An inverse eigenvalue problem for structured matrices determined by graph pairs
- Spectral arbitrariness for trees fails spectacularly
- The allow sequence of distinct eigenvalues for a sign pattern
- The liberation set in the inverse eigenvalue problem of a graph
- The strong spectral property of graphs: graph operations and barbell partitions
This page was built for publication: The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2144236)