Pages that link to "Item:Q1985452"
From MaRDI portal
The following pages link to The inverse eigenvalue problem of a graph: multiplicities and minors (Q1985452):
Displaying 26 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)
- Sign patterns of orthogonal matrices and the strong inner product property (Q1987018) (← links)
- The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph (Q2144236) (← links)
- The strong spectral property for graphs (Q2173323) (← links)
- A geometric Gauss-Newton method for least squares inverse eigenvalue problems (Q2192604) (← 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)
- Graphs that allow all the eigenvalue multiplicities to be even (Q2451699) (← links)
- On the inverse eigenvalue problems: the case of superstars (Q3559051) (← links)
- Spectral graph theory and the inverse eigenvalue problem of a graph (Q4656585) (← links)
- Tight Frame Graphs Arising as Line Graphs (Q4987379) (← links)
- Ordered multiplicity inverse eigenvalue problem for graphs on six vertices (Q4989751) (← links)
- Inverse eigenvalue and related problems for hollow matrices described by graphs (Q5060662) (← links)
- Riemannian Newton-CG methods for constructing a positive doubly stochastic matrix from spectral data* (Q5132266) (← links)
- The combinatorial inverse eigenvalue problem. II: All cases for small graphs (Q5501701) (← links)
- The combinatorial inverse eigenvalue problems: complete graphs and small graphs with strict inequality (Q5746833) (← 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)
- Diminimal families of arbitrary diameter (Q6178785) (← links)
- Sparks of symmetric matrices and their graphs (Q6202068) (← links)
- Distinct eigenvalues are realizable with generic eigenvectors (Q6608152) (← links)
- The inverse nullity pair problem and the strong nullity interlacing property (Q6615436) (← links)
- Spectral arbitrariness for trees fails spectacularly (Q6615753) (← links)
