On the semitotal forcing number of a graph
From MaRDI portal
Publication:2134991
DOI10.1007/S40840-021-01236-2zbMATH Open1487.05194OpenAlexW4205208524MaRDI QIDQ2134991FDOQ2134991
Authors: Qin Chen 
Publication date: 4 May 2022
Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40840-021-01236-2
Recommendations
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Zero forcing sets and the minimum rank of graphs
- Total domination in graphs
- Total domination number of grid graphs
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- Locating-total domination in claw-free cubic graphs
- On the total forcing number of a graph
- Semitotal domination in graphs
- Complexity and computation of connected zero forcing
- Total forcing and zero forcing in claw-free cubic graphs
- Connected power domination in graphs
- A lower bound on the zero forcing number
- A short proof for a lower bound on the zero forcing number
- Total forcing versus total domination in cubic graphs
- Zero forcing versus domination in cubic graphs
- Computing the zero forcing number for generalized Petersen graphs
Cited In (8)
- Zero forcing versus domination in cubic graphs
- Complete forcing numbers of complete and almost-complete multipartite graphs
- On trees and unicyclic graphs with equal forcing-type numbers
- Graphs with total forcing number two, revisited
- Note on forcing problem of trees
- Title not available (Why is that?)
- Total forcing and zero forcing in claw-free cubic graphs
- UPPER BOUNDS ON THE SEMITOTAL FORCING NUMBER OF 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)
