Pages that link to "Item:Q1715848"

The following pages link to A Nordhaus-Gaddum conjecture for the minimum number of distinct eigenvalues of a graph (Q1715848):

Displayed 9 items.

• A theorem on the number of distinct eigenvalues (Q2091740) ‎ (← 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)
• Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph'' (Q2217786) ‎ (← links)
• Achievable multiplicity partitions in the inverse eigenvalue problem of a graph (Q2302881) ‎ (← 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)