Note on forcing problem of trees
From MaRDI portal
Publication:2062888
DOI10.1007/s00373-021-02402-wzbMath1480.05102OpenAlexW4200118981MaRDI QIDQ2062888
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
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cites Work
- Unnamed Item
- 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 parameters and minimum rank problems
- 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 sets and zero forcing sets in trees
- A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
- Zero forcing in triangulations
- Zero forcing sets and the minimum rank of graphs
- Iteration Index of a Zero Forcing Set in a Graph
- A Graph Reduction Step Preserving Element-Connectivity and Applications
- The Zero Forcing Number of Graphs
- The forcing number of graphs with given girth
- Domination in Graphs Applied to Electric Power Networks
This page was built for publication: Note on forcing problem of trees
