The Global Set-Domination Number in Jump Graphs

Abstract

Let J(G) be a co-connected jump graph. A set D V(J(G)-D is a set dominating set (sd-set) if for every S V(J(G)-D there exists a non empty set T D such that the sub graph (S T) is connected. Further D is a global set dominating set, if D is an sd-set of both J(G) and J(). The set domination number √ s and the global set domination number √ sg of J(G) are defined as expected