Pages that link to "Item:Q313827"
From MaRDI portal
The following pages link to Proof of a conjecture on the zero forcing number of a graph (Q313827):
Displaying 18 items.
- Zero forcing propagation time on oriented graphs (Q526815) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Some bounds on the zero forcing number of a graph (Q1693145) (← links)
- On the total forcing number of a graph (Q1730228) (← links)
- Total forcing and zero forcing in claw-free cubic graphs (Q1756105) (← links)
- A lower bound on the zero forcing number (Q1801082) (← links)
- Total forcing versus total domination in cubic graphs (Q2011113) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- Zero forcing versus domination in cubic graphs (Q2025087) (← links)
- On extremal graphs for zero forcing number (Q2102756) (← links)
- Total forcing sets and zero forcing sets in trees (Q2175233) (← links)
- On the nullity of a connected graph in terms of order and maximum degree (Q2244875) (← links)
- On the zero forcing number of a graph involving some classical parameters (Q2292148) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- Maximum nullity and zero forcing number of graphs with rank at most 4 (Q5193233) (← links)
- Matching, path covers, and total forcing sets (Q5215393) (← links)
- UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS (Q6124016) (← links)
- On graphs maximizing the zero forcing number (Q6157420) (← links)
