r-Domination Number for Some Special Graphs

Abstract

In this study, bi- and triple effect- domination expands into r-domination. Given a finite, nontrivial, simple, undirected graph with no isolated vertex, a subset is -dominant if every dominates vertices from with . represents the minimum ultimate dominant set. For specific graphs, dominance is determined.