Pages that link to "Item:Q5146250"

The following pages link to Applications of analysis to the determination of the minimum number of distinct eigenvalues of a graph (Q5146250):

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)
• Orthogonal symmetric matrices and joins of graphs (Q2168925) (← links)
• The strong spectral property for graphs (Q2173323) (← links)
• Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph'' (Q2217786) (← links)
• On the inverse eigenvalue problem for block graphs (Q2238880) (← links)
• Achievable multiplicity partitions in the inverse eigenvalue problem of a graph (Q2302881) (← links)
• Tight Frame Graphs Arising as Line Graphs (Q4987379) (← links)
• Ordered multiplicity inverse eigenvalue problem for graphs on six vertices (Q4989751) (← links)
• Minimum number of distinct eigenvalues of graphs (Q5746835) (← links)
• Bordering of symmetric matrices and an application to the minimum number of distinct eigenvalues for the join of graphs (Q6084878) (← links)
• Regular graphs of degree at most four that allow two distinct eigenvalues (Q6084879) (← links)
• Sparsity of graphs that allow two distinct eigenvalues (Q6173926) (← links)
• Distinct eigenvalues are realizable with generic eigenvectors (Q6608152) (← links)