Note on forcing problem of trees

DOI10.1007/S00373-021-02402-WMaRDI QIDQ2062888zbMATH OpenOpenAlexFDO

Authors Mengya He, Shengjin Ji

Publication date 3 January 2022

Published in Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00373-021-02402-w

zbMATH Keywords

forcing numberforcing settotal forcing numbertotal forcing set

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• On trees and unicyclic graphs with equal forcing-type numbers
• Total forcing sets and zero forcing sets in trees
• Graphs with total forcing number two, revisited
• On the total forcing number of a graph
• On the semitotal forcing number of a graph

Cites work

• A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
• A Graph Reduction Step Preserving Element-Connectivity and Applications
• A lower bound on the zero forcing number
• Domination in Graphs Applied to Electric Power Networks
• Extremal values and bounds for the zero forcing number
• Iteration index of a zero forcing set in a graph
• Logic circuits from zero forcing
• On the total 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
• The Zero Forcing Number of Graphs
• Total forcing and zero forcing in claw-free cubic graphs
• Total forcing sets and zero forcing sets in trees
• 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 and power domination for graph products
• Zero forcing in triangulations
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs

Cited in

(11)

• On the total forcing number of a graph
• On trees and unicyclic graphs with equal forcing-type numbers
• Total forcing sets and zero forcing sets in trees
• Graphs with total forcing number two, revisited
• Matching, path covers, and total forcing sets
• Bounding the total forcing number of graphs
• The zero (total) forcing number and covering number of trees
• Well-forced graphs
• The extremal results for forcing problem of trees
• Semitotal forcing in claw-free cubic graphs
• Some results on the total (zero) forcing number of a graph

This page was built for publication: Note on forcing problem of trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2062888)