Key points are not available for this paper at this time.
Domination is an important theoretical concept in Graph theory.By j, k≤ for j = 1 and k = 2 that is every vertex ∊ - is just adjacent to at least j but not more than k vertices in D. The Domination number of G is denoted by , (), which the minimum cardinality of dominating set G. In this paper Generalization of j, k-Domination number of Cycle Graph has been studied.
Murugesan et al. (Sat,) studied this question.