Pages that link to "Item:Q3075182"

The following pages link to A lower bound for the number of distinct eigenvalues of some real symmetric matrices (Q3075182):

Displaying 14 items.

• A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph (Q1715848) (← links)
• A zero forcing technique for bounding sums of eigenvalue multiplicities (Q1979365) (← links)
• A theorem on the number of distinct eigenvalues (Q2091740) (← links)
• A note on the multiplicities of the eigenvalues of a tree (Q2168914) (← links)
• Orthogonal symmetric matrices and joins of graphs (Q2168925) (← links)
• On the multiplicity of eigenvalues of trees (Q2310395) (← links)
• A note on the multiplicities of graph eigenvalues (Q2437347) (← links)
• (Q4568076) (← links)
• On Orthogonal Matrices with Zero Diagonal (Q5230554) (← links)
• The characterization of the minimal weighted acyclic graphs (Q6103359) (← links)
• The effect of removing a 2-downer edge or a cut 2-downer edge triangle for an eigenvalue (Q6172905) (← links)
• Eigenvalue multiplicity of a graph in terms of the number of external vertices (Q6541324) (← links)
• On the Laplacian index of tadpole graphs (Q6590699) (← links)
• Distinct eigenvalues are realizable with generic eigenvectors (Q6608152) (← links)