Dom-forcing sets in graphs

2024/11/01 by P Susanth, P, Susanth, Charles Dominic +3 · 1 citation
Computer Science · #05C50 #05C69 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics

paper · pdf · doi:10.48550/arxiv.2411.00580

openalex publication_date 2024/11/01 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

A dominating set D_f⊆ V(G) of vertices in a graph G is called a dom-forcing set if the sub-graph induced by ⟨ D_f ⟩ must form a zero forcing set. The minimum cardinality of such a set is known as the dom-forcing number of the graph G, denoted by F_d(G). This article embarks on an exploration of the dom-forcing number of a graph G. Additionally, it delves into the precise determination of F_d(G) for certain well-known graphs

Cited by

• Connected dom-forcing sets in graphs

Related

• Connected dom-forcing sets in graphs
• On the Total Forcing Number of a Graph
• Zero Forcing sets and Power Dominating sets of cardinality at most 2
• Bounds on zero forcing using (upper) total domination and minimum degree
• Bounds on the connected forcing number of a graph