Vol. 3, Issue 12, Part A (2017)
A study on some roman dominating results in the field on graph theory
A study on some roman dominating results in the field on graph theory
Author(s)
S Lakshmi and V Priyadharshini
Abstract
A Roman dominating function on a graph G is a function f:V→{0,1,2} satisfying the condition that every vertex u∈ V for which f(u)=0 is adjacent to at least one vertex v∈ V for which f(v)=2. The weight of a roman dominating function is the value f(V)=∑v∈V f(v). The roman domination number γR (G) of G is the minimum weight of a Roman dominating function on G. A Roman dominating function on G is connected roman dominating function of G if either 〈V1∪V2 〉 or 〈V2 〉 is connected. The connected roman domination number γRC (G) of G is the minimum weight of a connected roman dominating function on G. A Roman dominating function on a block graph. A roman dominating function on a block graph B(G)=H is a function. The minimum weight of a roman dominating function on a block graph H is called the roman block domination number of G and is denoted by γRB (G). In this paper the roman domination number of block graph H and obtain some results on γRB (G) in terms of elements of G, but not in terms of H.
How to cite this article:
S Lakshmi, V Priyadharshini. A study on some roman dominating results in the field on graph theory. Int J Appl Res 2017;3(12):15-16.