SUBDIVISION NUMBER OF SPLIT POINT SET DOMINATION OF A GRAPH
Let G= (V,E) be a connected, nontrivial, simple, finite graph. In this paper a new parameter called subdivision split point set domination is introduced and is defined by a set D of vertices in a graph G is a subdivision point set domination, if (i) The graph obtained from a graph G by subdividing each edge of G exactly once (ii) For every set S⊆ V-D such that v∈ D, that is is connected. (iii) The induced sub graph
Domination Number, Split domination number, Point set domination number, Subdivision number of split point set domination number