Graphs with total forcing number two, revisited

DOI10.22044/JAS.2020.9229.1451MaRDI QIDQ4956465zbMATH OpenOpenAlexFDO

Authors Meysam Alishahi, Elahe Rezaei-Sani

Publication date 2 September 2021

Full work available at URL http://jas.shahroodut.ac.ir/article_2054_f054a10538ec58a6a4782c9d7458d295.pdf

zbMATH Keywords

zero forcing settotal forcing numberconnected forcing number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Planar graphs; geometric and topological aspects of graph theory (05C10)

Recommendations

• On trees and unicyclic graphs with equal forcing-type numbers
• Note on forcing problem of trees
• On the total forcing number of a graph
• Total forcing sets and zero forcing sets in trees
• On the semitotal forcing number of a graph

Cites work

• A protocol for cooling and controlling composite systems by local interactions
• A technique for computing the zero forcing number of a graph with a cut-vertex
• Bounds on the connected forcing number of a graph
• Characterizations of outerplanar graphs
• Complexity and computation of connected zero forcing
• Domination in Graphs Applied to Electric Power Networks
• Logic circuits from zero forcing
• On the total forcing number of a graph
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• Total forcing sets and zero forcing sets in trees
• Zero forcing sets and the minimum rank of graphs

Cited in

(6)

• Note on forcing problem of trees
• On the total forcing number of a graph
• Bounding the total forcing number of graphs
• On the semitotal forcing number of a graph
• Complete forcing numbers of complete and almost-complete multipartite graphs
• On trees and unicyclic graphs with equal forcing-type numbers

This page was built for publication: Graphs with total forcing number two, revisited

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