An inverse eigenvalue problem for structured matrices determined by graph pairs
From MaRDI portal
Recommendations
- The inverse nullity pair problem and the strong nullity interlacing property
- The λ − τ structured inverse eigenvalue problem
- The combinatorial inverse eigenvalue problem. II: All cases for small graphs
- Numerical construction of structured matrices with given eigenvalues
- On two conjectures regarding an inverse eigenvalue problem for acyclic symmetric matrices
Cites work
- Construction of matrices with a given graph and prescribed interlaced spectral data
- Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph
- Inertias of matrices and sign patterns related to a system of second order ODEs
- Inverse Problems and Zero Forcing for Graphs
- Spectrally arbitrary patterns
- Spectrally arbitrary patterns: Reducibility and the 2n conjecture for n = 5
- Stability of sign patterns from a system of second order ODEs
- Techniques for identifying inertially arbitrary patterns
- The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph
- The quadratic eigenvalue problem
Cited in
(2)
This page was built for publication: An inverse eigenvalue problem for structured matrices determined by graph pairs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6615438)