• STRONG ROMAN DOMINATION NUMBER OF CERTAIN CLASSES OF GRAPHS

Abstract

A Roman dominating function on a graph G = (V; E) is a function : V → {0, 1, 2} satisfying the condition that every vertex u for which (u) = 0 is adjacent to at least one vertex v for which f(v) = 2: The weight of a Roman dominating function is the value f(V ) = (u): The minimum weight of a Roman dominating function on a graph G is called the Roman dominating number of G: In this paper we study the strong Roman domination number of certain classes of graphs.