Pages that link to "Item:Q5225511"
From MaRDI portal
The following pages link to Bounds for the Zero Forcing Number of Graphs with Large Girth (Q5225511):
Displaying 32 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)
- Some bounds on the zero forcing number of a graph (Q1693145) (← links)
- On a conjecture of Gentner and Rautenbach (Q1699556) (← links)
- On the total forcing number of a graph (Q1730228) (← links)
- Bounds on the connected forcing number of a graph (Q1756082) (← 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)
- Tight bounds on probabilistic zero forcing on hypercubes and grids (Q2073291) (← links)
- On extremal graphs for zero forcing number (Q2102756) (← links)
- On the zero forcing number and spectral radius of graphs (Q2121770) (← links)
- Total forcing sets and zero forcing sets in trees (Q2175233) (← links)
- Probabilistic zero forcing on random graphs (Q2225411) (← links)
- A short proof for a lower bound on the zero forcing number (Q2282488) (← links)
- On the zero forcing number of a graph involving some classical parameters (Q2292148) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- Extremal \(k\)-forcing sets in oriented graphs (Q2416417) (← links)
- Maximum nullity and zero forcing of circulant graphs (Q2663691) (← links)
- The Zero Forcing Number of Graphs (Q4610449) (← links)
- The forcing number of graphs with given girth (Q4639236) (← links)
- Edge Forcing in Butterfly Networks (Q5025049) (← links)
- Propagation time for probabilistic zero forcing (Q5090539) (← 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)
- The zero forcing number of graphs with the matching number and the cyclomatic number (Q6172214) (← links)
- (Q6179673) (← links)
- Bounding the total forcing number of graphs (Q6181334) (← links)
- The zero (total) forcing number and covering number of trees (Q6614498) (← links)
