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.
No takes yet. Share an insight, caveat, or question.
Murugesan et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: