Pages that link to "Item:Q5746835"

The following pages link to Minimum number of distinct eigenvalues of graphs (Q5746835):

Displaying 32 items.

• The nowhere-zero eigenbasis problem for a graph (Q290677) (← links)
• The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph (Q332633) (← links)
• 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)
• The inverse eigenvalue problem of a graph: multiplicities and minors (Q1985452) (← links)
• Sign patterns of orthogonal matrices and the strong inner product property (Q1987018) (← links)
• Rigid linkages and partial zero forcing (Q2001975) (← links)
• Graphs with few distinct eigenvalues and extremal energy (Q2020686) (← links)
• Minimum number of distinct eigenvalues allowed by a sign pattern (Q2080259) (← links)
• 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)
• On the minimum number of distinct eigenvalues in the problem for a tree formed by Stieltjes strings (Q2203118) (← 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)
• Generalizations of the strong Arnold property and the minimum number of distinct eigenvalues of a graph (Q2363102) (← links)
• Graphs that allow all the eigenvalue multiplicities to be even (Q2451699) (← links)
• Frame graph (Q4643723) (← links)
• Tight Frame Graphs Arising as Line Graphs (Q4987379) (← links)
• Inverse eigenvalue and related problems for hollow matrices described by graphs (Q5060662) (← links)
• (Q5089234) (← links)
• On Orthogonal Matrices with Zero Diagonal (Q5230554) (← links)
• An explicit upper bound on disparity for trees of a given diameter (Q5887698) (← 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)
• Sparsity of graphs that allow two distinct eigenvalues (Q6173926) (← links)
• Diminimal families of arbitrary diameter (Q6178785) (← links)
• The allow sequence of distinct eigenvalues for a sign pattern (Q6198239) (← links)
• Distinct eigenvalues are realizable with generic eigenvectors (Q6608152) (← links)