Pages that link to "Item:Q5501701"

The following pages link to The combinatorial inverse eigenvalue problem. II: All cases for small graphs (Q5501701):

Displaying 14 items.

• The nowhere-zero eigenbasis problem for a graph (Q290677) (← links)
• 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)
• On the inverse eigenvalue problems: the case of superstars (Q3559051) (← links)
• Inverse eigenvalue and related problems for hollow matrices described by graphs (Q5060662) (← links)
• Riemannian Newton-CG methods for constructing a positive doubly stochastic matrix from spectral data* (Q5132266) (← links)
• The combinatorial inverse eigenvalue problems: complete graphs and small graphs with strict inequality (Q5746833) (← links)
• The liberation set in the inverse eigenvalue problem of a graph (Q6168543) (← links)
• Sparks of symmetric matrices and their graphs (Q6202068) (← links)
• Spectral arbitrariness for trees fails spectacularly (Q6615753) (← links)