Pages that link to "Item:Q442213"
From MaRDI portal
The following pages link to Propagation time for zero forcing on a graph (Q442213):
Displayed 33 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)
- 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)
- 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)
- Total forcing sets and zero forcing sets in trees (Q2175233) (← 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)
- Throttling for Zero Forcing and Variants (Q5206911) (← links)
- Matching, path covers, and total forcing sets (Q5215393) (← links)
- On zero forcing number of graphs and their complements (Q5245854) (← links)