Total forcing sets and zero forcing sets in trees
DOI10.7151/DMGT.2136zbMATH Open1439.05082OpenAlexW2884898438WikidataQ129525537 ScholiaQ129525537MaRDI QIDQ2175233FDOQ2175233
Randy Davila, Michael A. Henning
Publication date: 28 April 2020
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.2136
Recommendations
Trees (05C05) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Zero forcing sets and the minimum rank of graphs
- Total Domination in Graphs
- Title not available (Why is that?)
- Domination in Graphs Applied to Electric Power Networks
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Some bounds on the zero forcing number of a graph
- Proof of a conjecture on the zero forcing number of a graph
- Extremal values and bounds for the zero forcing number
- Propagation time for zero forcing on a graph
- Upper bounds on the \(k\)-forcing number of a graph
- Zero forcing number, constrained matchings and strong structural controllability
- Bounds for the Zero Forcing Number of Graphs with Large Girth
- Dynamic approach to k-forcing
- Extremal graphs without three‐cycles or four‐cycles
- On the total forcing number of a graph
- Complexity and computation of connected zero forcing
- A Graph Reduction Step Preserving Element-Connectivity and Applications
- Logic circuits from zero forcing
- The forcing number of graphs with given girth
Cited In (9)
- GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED
- The zero forcing number of graphs with the matching number and the cyclomatic number
- Zero forcing versus domination in cubic graphs
- On trees and unicyclic graphs with equal forcing-type numbers
- Bounding the total forcing number of graphs
- The zero (total) forcing number and covering number of trees
- The zero forcing number of claw-free cubic graphs
- Note on forcing problem of trees
- Total forcing and zero forcing in claw-free cubic graphs
This page was built for publication: Total forcing sets and zero forcing sets in trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2175233)
