The Strong Non Split Domination Of A Jump Graph

A dominating set of a jump graph J (G)= (V, E) is a strong dominating set if the induced sub graph < V-D > is complete. The strong non split domination number ᵞns(J(G)) of J(G) is minimum cardinality of a strong non split dominating set. In this paper we relate this parameter to the parameters of jump graph J(G) and obtain its exact values for some standard graphs.