Total forcing sets and zero forcing sets in trees

DOI10.7151/DMGT.2136MaRDI QIDQ2175233zbMATH OpenOpenAlexWikidataFDO

Authors Randy Davila, Michael A. Henning

Publication date 28 April 2020

Published in Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported

Full work available at URL https://doi.org/10.7151/dmgt.2136

zbMATH Keywords

forcing numberforcing settotal forcing numbertotal forcing set

Mathematics Subject Classification ID

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)

Recommendations

• Matching, path covers, and total forcing sets
• On trees and unicyclic graphs with equal forcing-type numbers
• Note on forcing problem of trees
• Total forcing and zero forcing in claw-free cubic graphs
• On the total forcing number of a graph

Cites work

• scientific article; zbMATH DE number 3172309 (Why is no real title available?)
• scientific article; zbMATH DE number 1095171 (Why is no real title available?)
• A Graph Reduction Step Preserving Element-Connectivity and Applications
• Bounds for the Zero Forcing Number of Graphs with Large Girth
• Complexity and computation of connected zero forcing
• Domination in Graphs Applied to Electric Power Networks
• Dynamic approach to k-forcing
• Extremal graphs without three‐cycles or four‐cycles
• Extremal values and bounds for the zero forcing number
• Logic circuits from zero forcing
• On the total forcing number of a graph
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• Proof of a conjecture on the zero forcing number of a graph
• Propagation time for zero forcing on a graph
• Some bounds on the zero forcing number of a graph
• The forcing number of graphs with given girth
• Total domination in graphs
• Upper bounds on the \(k\)-forcing number of a graph
• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• Zero forcing number, constrained matchings and strong structural controllability
• Zero forcing sets and the minimum rank of graphs

Cited in

(12)

• The zero forcing number of graphs with the matching number and the cyclomatic number
• Maximum nullity and zero forcing number on graphs with maximum degree at most three
• 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
• Graphs with total forcing number two, revisited
• The zero forcing number of claw-free cubic graphs
• Note on forcing problem of trees
• On the total forcing number of a graph
• Total forcing and zero forcing in claw-free cubic graphs
• Matching, path covers, and total forcing sets

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)