Throttling for Zero Forcing and Variants
From MaRDI portal
Publication:5206911
zbMath1437.05070arXiv1807.07030MaRDI QIDQ5206911
Publication date: 19 December 2019
Full work available at URL: https://arxiv.org/abs/1807.07030
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)
Related Items (5)
Various characterizations of throttling numbers ⋮ Throttling for standard zero forcing on directed graphs ⋮ Unnamed Item ⋮ Product throttling ⋮ Power domination throttling
Cites Work
- Unnamed Item
- Unnamed Item
- Fast-mixed searching and related problems on graphs
- Propagation time for zero forcing on a graph
- Mixed searching and proper-path-width
- Multiplicities of eigenvalues and tree-width of graphs
- Throttling positive semidefinite zero forcing propagation time on graphs
- Power domination throttling
- Zero forcing sets and the minimum rank of graphs
- Nondiscriminatory propagation on trees
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
This page was built for publication: Throttling for Zero Forcing and Variants