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

Vol. 14 No. 2: (April 2021)

Section

Nonlinear Analysis

License

Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.

By agreeing to this statement, you acknowledge that:

  • You retain full copyright over your work.
  • The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
  • This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.

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