Pages that link to "Item:Q1756082"
From MaRDI portal
The following pages link to Bounds on the connected forcing number of a graph (Q1756082):
Displaying 13 items.
- Maximum nullity and zero forcing number on graphs with maximum degree at most three (Q777379) (← links)
- On the total forcing number of a graph (Q1730228) (← 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)
- On trees and unicyclic graphs with equal forcing-type numbers (Q2147600) (← links)
- On the zero forcing number of a graph involving some classical parameters (Q2292148) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED (Q4956465) (← links)
- Edge Forcing in Butterfly Networks (Q5025049) (← links)
- (Q5076794) (← links)
- The zero forcing number of claw-free cubic graphs (Q6633547) (← links)
