The following pages link to (Q5374237):
Displaying 38 items.
- Power domination on triangular grids with triangular and hexagonal shape (Q782760) (← links)
- Nordhaus-Gaddum problems for power domination (Q1627850) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Note on power propagation time and lower bounds for the power domination number (Q1680484) (← links)
- Zero forcing in iterated line digraphs (Q1727740) (← links)
- The relationship between \(k\)-forcing and \(k\)-power domination (Q1744766) (← links)
- Bounds on expected propagation time of probabilistic zero forcing (Q1979443) (← links)
- Rigid linkages and partial zero forcing (Q2001975) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- On a conjecture for power domination (Q2042204) (← links)
- Note on forcing problem of trees (Q2062888) (← links)
- On the zero forcing number and propagation time of oriented graphs (Q2131584) (← links)
- On the length of L-Grundy sequences (Q2172087) (← links)
- On the power domination number of the Cartesian product of graphs (Q2176150) (← links)
- Zero forcing and maximum nullity for hypergraphs (Q2185737) (← links)
- On Grundy total domination number in product graphs (Q2214319) (← links)
- Grundy domination and zero forcing in regular graphs (Q2238998) (← links)
- Infectious power domination of hypergraphs (Q2286585) (← links)
- On the zero forcing number of a graph involving some classical parameters (Q2292148) (← links)
- Power domination throttling (Q2330105) (← links)
- Zero forcing in triangulations (Q2423536) (← links)
- Restricted power domination and zero forcing problems (Q2424658) (← links)
- Minimum rank and zero forcing number for butterfly networks (Q2424660) (← links)
- Connected power domination in graphs (Q2424811) (← links)
- Maximum nullity and zero forcing of circulant graphs (Q2663691) (← links)
- The \((d-2)\)-leaky forcing number of \(Q_d\) and \(\ell\)-leaky forcing number of \(GP(n,1)\) (Q2684050) (← links)
- Reconfiguration graphs of zero forcing sets (Q2686137) (← links)
- Using Markov chains to determine expected propagation time for probabilistic zero forcing (Q3299342) (← links)
- Algorithms and Complexity of Power Domination in Graphs (Q3384121) (← links)
- Power Domination in Graphs (Q3384619) (← links)
- (Q4611353) (← links)
- (Q5065227) (← links)
- Constructions of cospectral graphs with different zero forcing numbers (Q5078599) (← links)
- Propagation time for probabilistic zero forcing (Q5090539) (← links)
- Failed power domination on graphs (Q5109066) (← links)
- Zero forcing in Benzenoid network (Q5142119) (← links)
- The liberation set in the inverse eigenvalue problem of a graph (Q6168543) (← links)
- 2-power domination number for Knödel graphs and its application in communication networks (Q6181254) (← links)
