r-Domination Number for Some Special Graphs
Keywords:
r-domination number, adjacent, dominating set.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.
Downloads
Download data is not yet available.
Downloads
Published
2023-12-31
Issue
Section
Mathematics
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.