Bounding the total forcing number of graphs
From MaRDI portal
Publication:6181334
DOI10.1007/s10878-023-01089-4OpenAlexW4388736294MaRDI QIDQ6181334
Shengjin Ji, Wenqian Zhang, Unnamed Author, Mengya He, Yingui Pan
Publication date: 22 January 2024
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-023-01089-4
Trees (05C05) Enumeration in graph theory (05C30) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- 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
- Total forcing and zero forcing in claw-free cubic graphs
- A lower bound on the zero forcing number
- Logic circuits from zero forcing
- Total forcing versus total domination in cubic graphs
- Complexity and computation of connected zero forcing
- Total forcing sets and zero forcing sets in trees
- Zero forcing sets and the minimum rank of graphs
- Power domination in graphs
- Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs
- The Zero Forcing Number of Graphs
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Zero forcing number of a graph in terms of the number of pendant vertices
- Matching, path covers, and total forcing sets
- Bounds for the Zero Forcing Number of Graphs with Large Girth
- Dynamic approach to k-forcing
This page was built for publication: Bounding the total forcing number of graphs
