Pages that link to "Item:Q2012050"
From MaRDI portal
The following pages link to Complexity and computation of connected zero forcing (Q2012050):
Displaying 20 items.
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- On the total forcing number of a graph (Q1730228) (← links)
- The zero forcing polynomial of a graph (Q1732095) (← links)
- Total forcing versus total domination in cubic graphs (Q2011113) (← 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 semitotal forcing number of a graph (Q2134991) (← links)
- On trees and unicyclic graphs with equal forcing-type numbers (Q2147600) (← links)
- Total forcing sets and zero forcing sets in trees (Q2175233) (← links)
- On the zero blocking number of rectangular, cylindrical, and Möbius grids (Q2185728) (← links)
- Blocking zero forcing processes in Cartesian products of graphs (Q2197448) (← links)
- Probabilistic zero forcing on random graphs (Q2225411) (← links)
- On the zero forcing number of a graph involving some classical parameters (Q2292148) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- Power domination throttling (Q2330105) (← links)
- Connected power domination in graphs (Q2424811) (← links)
- GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED (Q4956465) (← links)
- On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme (Q6124433) (← links)
- Bounding the total forcing number of graphs (Q6181334) (← links)
