Forcing Subsets for γ∗ tpw -sets in Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v14i2.3914Keywords:
forcing domination, total domination, dr-power domination, path, cycleAbstract
In this paper, the lower and upper bounds of the forcing total dr-power domination
number of any graph are determined. Total dr-power domination number of some special graphs such as complete graphs, star, fan and wheel graphs are shown. Moreover, the forcing total dr-power domination number of these graphs, together with paths and cycles, are determined.
Downloads
Published
2021-05-18
Issue
Section
Nonlinear Analysis
License
Upon acceptance of an article by the journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.
European Journal of Pure and Applied Mathematics will be Copyright Holder.
How to Cite
Forcing Subsets for γ∗ tpw -sets in Graphs. (2021). European Journal of Pure and Applied Mathematics, 14(2), 451-470. https://doi.org/10.29020/nybg.ejpam.v14i2.3914