The theory of domination and split domination in graphs is a rich topic of investigation both from the point of view of theory and application. Computer science is a branch in which the use of graphs have become indispensable, specifically in problems such as load balancing for massively parallel computer architectures. The aim of this thesis is to discussed about the split domination number for some special graphs and also found the split domination number for complementary of some special graphs.