GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED

DOI10.22044/jas.2020.9229.1451zbMath1468.05198OpenAlexW3197255919MaRDI QIDQ4956465

Elahe Rezaei-Sani, Meysam Alishahi

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

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

Cites Work

• Unnamed Item
• A technique for computing the zero forcing number of a graph with a cut-vertex
• Characterizations of outerplanar graphs
• On the total forcing number of a graph
• Bounds on the connected forcing number of a graph
• Logic circuits from zero forcing
• 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
• Domination in Graphs Applied to Electric Power Networks
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph

This page was built for publication: GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED