Pages that link to "Item:Q5746833"

The following pages link to The combinatorial inverse eigenvalue problems: complete graphs and small graphs with strict inequality (Q5746833):

Displaying 9 items.

• Multiplicity lists for symmetric matrices whose graphs have few missing edges (Q1688915) (← links)
• The inverse eigenvalue problem of a graph: multiplicities and minors (Q1985452) (← links)
• The strong spectral property for graphs (Q2173323) (← links)
• On the inverse eigenvalue problem for block graphs (Q2238880) (← links)
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph (Q2363102) (← links)
• The combinatorial inverse eigenvalue problem. II: All cases for small graphs (Q5501701) (← links)
• The liberation set in the inverse eigenvalue problem of a graph (Q6168543) (← links)
• The inverse nullity pair problem and the strong nullity interlacing property (Q6615436) (← links)
• Spectral arbitrariness for trees fails spectacularly (Q6615753) (← links)