Pages that link to "Item:Q3448171"

The following pages link to Using variants of zero forcing to bound the inertia set of a graph (Q3448171):

Displaying 10 items.

• Computational approaches for zero forcing and related problems (Q1631510) (← links)
• The zero forcing polynomial of a graph (Q1732095) (← links)
• A zero forcing technique for bounding sums of eigenvalue multiplicities (Q1979365) (← links)
• Complexity and computation of connected zero forcing (Q2012050) (← links)
• Properties of a \(q\)-analogue of zero forcing (Q2227980) (← links)
• A reduction procedure for the Colin de Verdière number of a graph (Q2309677) (← links)
• The maximum multiplicity of the largest \(k\)-th eigenvalue in a matrix whose graph is acyclic or unicyclic (Q2317668) (← links)
• Reconfiguration graphs of zero forcing sets (Q2686137) (← links)
• An integer program for positive semidefinite zero forcing in graphs (Q6092625) (← links)
• The \(q\)-analogue of zero forcing for certain families of graphs (Q6124425) (← links)