On the total forcing number of a graph
From MaRDI portal
Publication:1730228
DOI10.1016/j.dam.2018.09.001zbMath1406.05072arXiv1702.06035OpenAlexW2963391000MaRDI QIDQ1730228
Michael A. Henning, Randy Davila
Publication date: 11 March 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.06035
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)
Related Items (17)
GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED ⋮ On the semitotal forcing number of a graph ⋮ On trees and unicyclic graphs with equal forcing-type numbers ⋮ Total forcing sets and zero forcing sets in trees ⋮ On the zero blocking number of rectangular, cylindrical, and Möbius grids ⋮ UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS ⋮ On the diameter and zero forcing number of some graph classes in the Johnson, Grassmann and Hamming association scheme ⋮ Blocking zero forcing processes in Cartesian products of graphs ⋮ Bounding the total forcing number of graphs ⋮ Total forcing and zero forcing in claw-free cubic graphs ⋮ Total forcing versus total domination in cubic graphs ⋮ Zero forcing versus domination in cubic graphs ⋮ On the zero forcing number of a graph involving some classical parameters ⋮ Note on forcing problem of trees ⋮ Maximum nullity and zero forcing number on graphs with maximum degree at most three ⋮ On extremal graphs for zero forcing number ⋮ Edge Forcing in Butterfly Networks
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
- Bounds on the connected forcing number of a graph
- A lower bound on the zero forcing number
- Logic circuits from zero forcing
- Complexity and computation of connected zero forcing
- Zero forcing sets and the minimum rank of graphs
- Power domination in graphs
- A Graph Reduction Step Preserving Element-Connectivity and Applications
- 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: On the total forcing number of a graph
