The following pages link to (Q5501701):
Displaying 9 items.
- Multiplicity lists for symmetric matrices whose graphs have few missing edges (Q1688915) (← links)
- A zero forcing technique for bounding sums of eigenvalue multiplicities (Q1979365) (← links)
- The inverse eigenvalue problem of a graph: multiplicities and minors (Q1985452) (← links)
- The strong spectral property for graphs (Q2173323) (← links)
- A geometric Gauss-Newton method for least squares inverse eigenvalue problems (Q2192604) (← links)
- On the inverse eigenvalue problem for block graphs (Q2238880) (← links)
- Riemannian Newton-CG methods for constructing a positive doubly stochastic matrix from spectral data* (Q5132266) (← links)
- The liberation set in the inverse eigenvalue problem of a graph (Q6168543) (← links)
- Sparks of symmetric matrices and their graphs (Q6202068) (← links)
