Pages that link to "Item:Q836996"

The following pages link to The inverse inertia problem for graphs: Cut vertices, trees, and a counterexample (Q836996):

Displaying 26 items.

• Using a new zero forcing process to guarantee the strong Arnold property (Q306447) (← links)
• The maximum of the minimal multiplicity of eigenvalues of symmetric matrices whose pattern is constrained by a graph (Q332633) (← links)
• Decompositions of minimum rank matrices (Q389662) (← links)
• Minimum rank of outerplanar graphs (Q417506) (← links)
• Computing inertia sets using atoms (Q417545) (← links)
• On the inertia set of a signed tree with loops (Q501253) (← links)
• Max-min problems on the ranks and inertias of the matrix expressions \(A - BXC \pm (BXC)^{\ast}\) with applications (Q535072) (← links)
• Expansion formulas for the inertias of Hermitian matrix polynomials and matrix pencils of orthogonal projectors (Q624568) (← links)
• The inertia set of the join of graphs (Q632470) (← links)
• The inertia sets of graphs with a 2-separation (Q744118) (← links)
• On minimum rank and zero forcing sets of a graph (Q967512) (← links)
• The minimum rank problem over the finite field of order 2: Minimum rank 3 (Q999773) (← links)
• The inverse Voronoi problem in graphs. I: Hardness (Q2006948) (← links)
• The bifurcation lemma for strong properties in the inverse eigenvalue problem of a graph (Q2144236) (← links)
• On the inertia set of a signed graph with loops (Q2261536) (← links)
• The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic (Q2317668) (← links)
• The inverse inertia problem for the complements of partial \(k\)-trees (Q2435477) (← links)
• Graphs that allow all the eigenvalue multiplicities to be even (Q2451699) (← links)
• The inertia set of a signed graph (Q2637138) (← links)
• Inertia sets for graphs on six or fewer vertices (Q3559089) (← links)
• Ordered multiplicity inverse eigenvalue problem for graphs on six vertices (Q4989751) (← links)
• (Q5028519) (← links)
• The minimum rank problem for circulants (Q5962494) (← links)
• The \(q\)-analogue of zero forcing for certain families of graphs (Q6124425) (← links)
• The inverse nullity pair problem and the strong nullity interlacing property (Q6615436) (← links)
• Spectral arbitrariness for trees fails spectacularly (Q6615753) (← links)