Let G=(V, E) be a graph with vertex set V and edge set E. A Roman dominating function is a
mapping f: V→{0, 1, 2} such that every vertex u for which f (u)= 0 is adjacent to at least one …