• STRONG ROMAN DOMINATION NUMBER OF CERTAIN CLASSES OF GRAPHS

K. SELVAKUMAR, M. KAMARAJ*

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.


Keywords


Strong Roman domination, Strong Roman domination number.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2020 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter