Pages that link to "Item:Q4989751"

The following pages link to Ordered multiplicity inverse eigenvalue problem for graphs on six vertices (Q4989751):

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)
• On the minimum number of distinct eigenvalues of a threshold graph (Q2133671) (← links)
• Orthogonal symmetric matrices and joins of graphs (Q2168925) (← links)
• The strong spectral property for graphs (Q2173323) (← links)
• On the inverse eigenvalue problem for block graphs (Q2238880) (← links)
• Achievable multiplicity partitions in the inverse eigenvalue problem of a graph (Q2302881) (← links)
• (Q5060662) (← 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)
• The strong spectral property of graphs: graph operations and barbell partitions (Q6154374) (← links)
• The liberation set in the inverse eigenvalue problem of a graph (Q6168543) (← links)
• Sparsity of graphs that allow two distinct eigenvalues (Q6173926) (← links)
• Sparks of symmetric matrices and their graphs (Q6202068) (← links)