Pages that link to "Item:Q763073"
From MaRDI portal
The following pages link to Zero forcing sets and bipartite circulants (Q763073):
Displayed 12 items.
- Proof of a conjecture on the zero forcing number of a graph (Q313827) (← links)
- Extremal values and bounds for the zero forcing number (Q317429) (← links)
- Upper bounds on the \(k\)-forcing number of a graph (Q479006) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Some bounds on the zero forcing number of a graph (Q1693145) (← links)
- Bounds on the connected forcing number of a graph (Q1756082) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- On the zero forcing number of a graph involving some classical parameters (Q2292148) (← links)
- Typical and generic ranks in matrix completion (Q2332456) (← links)
- On tight bounds for the \(k\)-forcing number of a graph (Q2421385) (← links)
- Maximum nullity and zero forcing of circulant graphs (Q2663691) (← links)
- Zero forcing number of a graph in terms of the number of pendant vertices (Q4965925) (← links)