Total forcing sets and zero forcing sets in trees
From MaRDI portal
Publication:2175233
DOI10.7151/dmgt.2136zbMath1439.05082OpenAlexW2884898438WikidataQ129525537 ScholiaQ129525537MaRDI QIDQ2175233
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
Trees (05C05) Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (7)
GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED ⋮ On trees and unicyclic graphs with equal forcing-type numbers ⋮ The zero forcing number of graphs with the matching number and the cyclomatic number ⋮ Bounding the total forcing number of graphs ⋮ Total forcing and zero forcing in claw-free cubic graphs ⋮ Zero forcing versus domination in cubic graphs ⋮ Note on forcing problem of trees
Cites Work
- Unnamed Item
- Unnamed Item
- Proof of a conjecture on the zero forcing number of a graph
- Extremal values and bounds for the zero forcing number
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- 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
- Some bounds on the zero forcing number of a graph
- On the total forcing number of a graph
- Logic circuits from zero forcing
- Complexity and computation of connected zero forcing
- Zero forcing sets and the minimum rank of graphs
- A Graph Reduction Step Preserving Element-Connectivity and Applications
- Extremal graphs without three‐cycles or four‐cycles
- The forcing number of graphs with given girth
- Domination in Graphs Applied to Electric Power Networks
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Total Domination in Graphs
- Bounds for the Zero Forcing Number of Graphs with Large Girth
- Dynamic approach to k-forcing
This page was built for publication: Total forcing sets and zero forcing sets in trees
