On the Forcing edge Steiner Global Domination Number of a Graph

Abstract

Let W be the minimum edge Steiner global dominance set of a connected graph G. If W is the only minimum edge Steiner global dominating set that contains T, then a subset T   W  is referred to as a forcing subset for W. A minimum forcing subset of W is a forcing subset for W with minimum cardinality. The cardinality of a minimal forcing subset of W is its forcing edge Steiner global dominance number, represented by f_(¯γ se) (W). f_(¯γ se) (G) = min{f_(¯γ se) (W)}, is the forcing edge Steiner global domination number of G, represented by f_(¯γ se) (G), where the minimum is obtained across all minimal edge Steiner global dominating sets W in G. The forcing Steiner and edge Steiner global dominance number of a graph is given some realisation findings in this article.