Pages that link to "Item:Q632470"
From MaRDI portal
The following pages link to The inertia set of the join of graphs (Q632470):
Displaying 13 items.
- The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph (Q332633) (← links)
- Computing inertia sets using atoms (Q417545) (← links)
- The inertia sets of graphs with a 2-separation (Q744118) (← links)
- The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample (Q836996) (← links)
- On the null space of a Colin de Verdière matrix (Q1296155) (← links)
- Inertia and biclique decompositions of joins of graphs (Q1405108) (← links)
- Orthogonal symmetric matrices and joins of graphs (Q2168925) (← links)
- Corrigendum to: ``Achievable multiplicity partitions in the inverse eigenvalue problem of a graph'' (Q2217786) (← links)
- On the inertia set of a signed graph with loops (Q2261536) (← 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)
- Inertia sets for graphs on six or fewer vertices (Q3559089) (← links)
- (Q5028519) (← links)