Total forcing versus total domination in cubic graphs
From MaRDI portal
Publication:2011113
DOI10.1016/j.amc.2019.02.060zbMath1428.05230OpenAlexW2920862054WikidataQ128264272 ScholiaQ128264272MaRDI QIDQ2011113
Randy Davila, Michael A. Henning
Publication date: 28 November 2019
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2019.02.060
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (7)
On the semitotal forcing number of a graph ⋮ On trees and unicyclic graphs with equal forcing-type numbers ⋮ The forcing nonsplit domination number of a graph ⋮ Partial domination and irredundance numbers in graphs ⋮ Bounding the total forcing number of graphs ⋮ Algorithm and hardness results on neighborhood total domination in graphs ⋮ Zero forcing versus domination in cubic graphs
Cites Work
- 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
- A survey of selected recent results on total domination in graphs
- Covering all cliques of a graph
- Small transversals in hypergraphs
- Some bounds on the zero forcing number of a graph
- On the total forcing number of a graph
- Bounds on the connected forcing number of a graph
- Total forcing and zero forcing in claw-free cubic graphs
- 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
- Some remarks on domination
- 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 versus total domination in cubic graphs
