An Investigation of Corona Domination Number for Some Special Graphs and Jahangir Graph

In this work, the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let H be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in <S> is either a pendant vertex or a support vertices. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by gamma(CD)(H). (i.e)gamma(CD)(H) = min{vertical bar S vertical bar : S is a CD - set of H}. In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obtain the results on other domination parameters.