Article
Kyungpook Mathematical Journal 2021; 61(3): 661-669
Published online September 30, 2021
Copyright © Kyungpook Mathematical Journal.
Complexity Issues of Perfect Roman Domination in Graphs
Padamutham Chakradhar*, Palagiri Venkata Subba Reddy
Department of Computer Science and Engineering, National Institute of Techonology, Warangal, India
e-mail : corneliusp7@gmail.com and venkatpalagiri@gmail.com
Received: November 6, 2019; Revised: October 12, 2021; Accepted: November 23, 2020
For a simple, undirected graph G = (V, E), a perfect Roman dominating function (PRDF) f : V → {0, 1, 2} has the property that, every vertex u with f(u) = 0 is adjacent to xactly one vertex v for which f(v) = 2. The weight of a PRDF is the sum
Keywords: Roman domination, Perfect Roman domination, NP-complete.