More on Perfect Roman Domination in Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v13i3.3763Keywords:
Roman dominating function, perfect Roman dominating function, Roman domination number, perfect Roman domination numberAbstract
A perfect Roman dominating function on a graph G = (V (G), E(G)) is a function f : V (G) → {0, 1, 2} for which each u ∈ V (G) with f(u) = 0 is adjacent to exactly one vertex v ∈ V (G) with f(v) = 2. The weight of a perfect Roman dominating function f is the value ωG(f) = Pv∈V (G) f(v). The perfect Roman domination number of G is the minimum weight of a perfect Roman dominating function on G. In this paper, we study the perfect Roman domination numbers of graphs under some binary operationDownloads
Published
2020-07-31
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
More on Perfect Roman Domination in Graphs. (2020). European Journal of Pure and Applied Mathematics, 13(3), 529-548. https://doi.org/10.29020/nybg.ejpam.v13i3.3763