The combinatorial inverse eigenvalue problem. II: All cases for small graphs
From MaRDI portal
Publication:5501701
Recommendations
- The combinatorial inverse eigenvalue problems: complete graphs and small graphs with strict inequality
- The λ − τ structured inverse eigenvalue problem
- The inverse eigenvalue problem of a graph: multiplicities and minors
- Graphs that allow all the eigenvalue multiplicities to be even
- The inverse eigenvalue and inertia problems for minimum rank two graphs
Cited in
(16)- On the inverse eigenvalue problems: the case of superstars
- Complementary Vanishing Graphs
- The nowhere-zero eigenbasis problem for a graph
- Multiplicity lists for symmetric matrices whose graphs have few missing edges
- The combinatorial inverse eigenvalue problems: complete graphs and small graphs with strict inequality
- Sparks of symmetric matrices and their graphs
- The strong spectral property for graphs
- An inverse eigenvalue problem for structured matrices determined by graph pairs
- Riemannian Newton-CG methods for constructing a positive doubly stochastic matrix from spectral data
- Spectral arbitrariness for trees fails spectacularly
- A zero forcing technique for bounding sums of eigenvalue multiplicities
- The inverse eigenvalue problem of a graph: multiplicities and minors
- On the inverse eigenvalue problem for block graphs
- scientific article; zbMATH DE number 7640506 (Why is no real title available?)
- The liberation set in the inverse eigenvalue problem of a graph
- A geometric Gauss-Newton method for least squares inverse eigenvalue problems
This page was built for publication: The combinatorial inverse eigenvalue problem. II: All cases for small graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5501701)