Recommendations
Cites work
- A lower bound on the zero forcing number
- A short proof for a lower bound on the zero forcing number
- Complexity and computation of connected zero forcing
- Computing the zero forcing number for generalized Petersen graphs
- Connected power domination in graphs
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- Locating-total domination in claw-free cubic graphs
- On the total forcing number of a graph
- Semitotal domination in graphs
- Total domination in graphs
- Total domination number of grid graphs
- Total forcing and zero forcing in claw-free cubic graphs
- Total forcing versus total domination in cubic graphs
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- Zero forcing sets and the minimum rank of graphs
- Zero forcing versus domination in cubic graphs
Cited in
(9)- Total forcing and zero forcing in claw-free cubic graphs
- Zero forcing versus domination in cubic graphs
- Note on forcing problem of trees
- On trees and unicyclic graphs with equal forcing-type numbers
- Graphs with total forcing number two, revisited
- scientific article; zbMATH DE number 5175631 (Why is no real title available?)
- Complete forcing numbers of complete and almost-complete multipartite graphs
- UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF GRAPHS
- Semitotal forcing in claw-free cubic graphs
This page was built for publication: On the semitotal forcing number of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2134991)
