Domination Parameters Of Split Graphs

A set D of vertices in a graph G is a dominating set if every vertex not in D is adjacent to atleast one vertex in D. The domination number γ(G) is the minimum cardinality of a dominating set of G. In this paper we investigate certain domination parameters of cyclic split graph, uniform n-fan split graph, uniform n-wheel split graph and uniform n-star split graph