Open AccessForcing Subsets for γ∗ tpw -sets in Graphs
Author(s) -
Cris Laquibla Armada
Publication year - 2021
Publication title -
european journal of pure and applied mathematics
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.245
H-Index - 5
ISSN - 1307-5543
DOI - 10.29020/nybg.ejpam.v14i2.3914
Subject(s) - mathematics , forcing (mathematics) , chordal graph , combinatorics , graph , indifference graph , pathwidth , discrete mathematics , star (game theory) , power (physics) , line graph , mathematical analysis , physics , quantum mechanics
In this paper, the lower and upper bounds of the forcing total dr-power dominationnumber 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.