The following pages link to Zero forcing for sign patterns (Q2451650):
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)
- Rigid linkages and partial zero forcing (Q2001975) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- Zero forcing and maximum nullity for hypergraphs (Q2185737) (← links)
- Some properties of the closed global shadow graphs and their zero forcing number (Q2674159) (← links)
- Line graphs: Their maximum nullities and zero forcing numbers (Q2828813) (← links)
- Using variants of zero forcing to bound the inertia set of a graph (Q3448171) (← links)
- Ranks of zero patterns and sign patterns<sup>*</sup> (Q4291675) (← links)