Pages that link to "Item:Q442213"
From MaRDI portal
The following pages link to Propagation time for zero forcing on a graph (Q442213):
Displaying 50 items.
- Fractional zero forcing via three-color forcing games (Q313806) (← links)
- Proof of a conjecture on the zero forcing number of a graph (Q313827) (← links)
- Failed skew zero forcing on a graph (Q314747) (← links)
- Extremal values and bounds for the zero forcing number (Q317429) (← links)
- Upper bounds on the \(k\)-forcing number of a graph (Q479006) (← links)
- Zero forcing propagation time on oriented graphs (Q526815) (← links)
- Throttling for the game of cops and robbers on graphs (Q724850) (← links)
- On the relationship between the zero forcing number and path cover number for some graphs (Q779727) (← links)
- Positive semidefinite propagation time (Q897615) (← 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)
- Some bounds on the zero forcing number of a graph (Q1693145) (← links)
- Infection in hypergraphs (Q1701092) (← links)
- Throttling positive semidefinite zero forcing propagation time on graphs (Q1720308) (← links)
- On the total forcing number of a graph (Q1730228) (← links)
- The zero forcing polynomial of a graph (Q1732095) (← links)
- Grundy dominating sequences and zero forcing sets (Q1751247) (← links)
- Total forcing and zero forcing in claw-free cubic graphs (Q1756105) (← 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)
- On the error of \textit{a priori} sampling: zero forcing sets and propagation time (Q2002553) (← 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)
- Note on forcing problem of trees (Q2062888) (← links)
- Product throttling (Q2073191) (← links)
- Tight bounds on probabilistic zero forcing on hypercubes and grids (Q2073291) (← links)
- The language of epidemic (Q2079798) (← links)
- On the zero forcing number and propagation time of oriented graphs (Q2131584) (← links)
- Upper bounds for positive semidefinite propagation time (Q2144516) (← links)
- Total forcing sets and zero forcing sets in trees (Q2175233) (← links)
- Probabilistic zero forcing on random graphs (Q2225411) (← links)
- Properties of a \(q\)-analogue of zero forcing (Q2227980) (← links)
- Algorithms and applications for a class of bilevel MILPs (Q2283108) (← links)
- Zero forcing in claw-free cubic graphs (Q2302052) (← links)
- A computational comparison of compact MILP formulations for the zero forcing number (Q2328106) (← links)
- Power domination throttling (Q2330105) (← links)
- A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs (Q2403987) (← links)
- On tight bounds for the \(k\)-forcing number of a graph (Q2421385) (← links)
- Restricted power domination and zero forcing problems (Q2424658) (← links)
- Minimum rank and zero forcing number for butterfly networks (Q2424660) (← links)
- Multi-color forcing in graphs (Q2657055) (← links)
- Throttling processes equivalent to full throttling on trees (Q2661773) (← links)
- Throttling zero forcing propagation speed on graphs (Q2866604) (← 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)
- Edge Forcing in Butterfly Networks (Q5025049) (← links)
- Proper colorings from positive semidefinite zero forcing sets (Q5069779) (← links)
- Propagation time for probabilistic zero forcing (Q5090539) (← links)
- Connected zero forcing sets and connected propagation time of graphs (Q5139339) (← links)
