Forcing Subsets for γ∗ tpw -sets in Graphs

Authors

DOI:

https://doi.org/10.29020/nybg.ejpam.v14i2.3914

Keywords:

forcing domination, total domination, dr-power domination, path, cycle

Abstract

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.

Author Biography

  • Cris Laquibla Armada, Cebu Normal University
    Mathematics Department, College of Arts and Sciences, Cebu Normal University

Downloads

Published

2021-05-18

Issue

Section

Nonlinear Analysis

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