Pages that link to "Item:Q2782047"

The following pages link to Estimation of the maximum multiplicity of an eigenvalue in terms of the vertex degrees of the graph of a matrix (Q2782047):

Displayed 9 items.

• The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample (Q836996) ‎ (← links)
• Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns (Q855530) ‎ (← links)
• The trees for which maximum multiplicity implies the simplicity of other eigenvalues (Q856861) ‎ (← links)
• On the multiplicities of eigenvalues of a Hermitian matrix whose graph is a tree (Q931031) ‎ (← links)
• The structure of matrices with a maximum multiplicity eigenvalue (Q932157) ‎ (← links)
• Tree decomposition by eigenvectors (Q958004) ‎ (← links)
• The minimum rank of symmetric matrices described by a graph: a survey (Q996311) ‎ (← links)
• Inverse eigenvalue problems and lists of multiplicities of eigenvalues for matrices whose graph is a tree: The case of generalized stars and double generalized stars. (Q1414148) ‎ (← links)
• Undirected graphs of Hermitian matrices that admit only two distinct eigenvalues (Q2250939) ‎ (← links)