Pages that link to "Item:Q2910019"
From MaRDI portal
The following pages link to Iteration Index of a Zero Forcing Set in a Graph (Q2910019):
Displaying 23 items.
- Extremal values and bounds for the zero forcing number (Q317429) (← links)
- Propagation time for zero forcing on a graph (Q442213) (← links)
- Upper bounds on the \(k\)-forcing number of a graph (Q479006) (← links)
- Zero forcing propagation time on oriented graphs (Q526815) (← links)
- Positive semidefinite propagation time (Q897615) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Some bounds on the zero forcing number of a graph (Q1693145) (← links)
- Infection in hypergraphs (Q1701092) (← links)
- Effects of vertex degrees on the zero-forcing number and propagation time of a graph (Q1801062) (← links)
- Bounds on expected propagation time of probabilistic zero forcing (Q1979443) (← links)
- Note on forcing problem of trees (Q2062888) (← links)
- On the zero forcing number and propagation time of oriented graphs (Q2131584) (← links)
- Upper bounds for positive semidefinite propagation time (Q2144516) (← links)
- A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs (Q2403987) (← links)
- Extremal \(k\)-forcing sets in oriented graphs (Q2416417) (← links)
- On tight bounds for the \(k\)-forcing number of a graph (Q2421385) (← links)
- Multi-color forcing in graphs (Q2657055) (← links)
- Using Markov chains to determine expected propagation time for probabilistic zero forcing (Q3299342) (← links)
- Zero forcing number of a graph in terms of the number of pendant vertices (Q4965925) (← links)
- Propagation time for probabilistic zero forcing (Q5090539) (← links)
- Connected zero forcing sets and connected propagation time of graphs (Q5139339) (← links)
- The zero forcing number of graphs with the matching number and the cyclomatic number (Q6172214) (← links)
- (Q6179673) (← links)
