Pages that link to "Item:Q1688915"

The following pages link to Multiplicity lists for symmetric matrices whose graphs have few missing edges (Q1688915):

Displaying 6 items.

• The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph (Q332633) (← links)
• Ordered multiplicity lists for eigenvalues of symmetric matrices whose graph is a linear tree (Q400401) (← links)
• Orthogonal symmetric matrices and joins of graphs (Q2168925) (← links)
• Achievable multiplicity partitions in the inverse eigenvalue problem of a graph (Q2302881) (← links)
• Diagonalizable matrices whose graph is a tree: the minimum number of distinct eigenvalues and the feasibility of eigenvalue assignments (Q2302884) (← links)
• Further generalization of symmetric multiplicity theory to the geometric case over a field (Q2663701) (← links)