IJRET: International Journal of Research in Engineering and Technology

eISSN: 2319-1163 | pISSN: 2321-7308

CONNECTED ROMAN DOMINATION IN GRAPHS

M. H. Muddebihal1, Sumangaladevi2
1, 2

Department of Mathematics Gulbarga University, Gulbarga-585106, Karnataka, India

mhmuddebihal@yahoo.co.in, sumangaladevi.s@gmail.com

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 ) f (v) . The Roman domination number R G of G is the minimum weight of a Roman dominating function on
vV

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 .

In this paper we establish the upper bounds, lower bounds and some equality results for RC

G .

Keywords: Domination number, Roman domination number and Connected Roman domination number.
Subject Classification number: 05C69, 05C70.
---------------------------------------------------------------------***-----------------------------------------------------------------------1. INTRODUCTION
Let

G V , E be a simple

and q

p, q

graph with

pV

E . We denote open neighborhood of a vertex v of

G by N v and its closed neighborhood by N v . For a

vertex

set S

V G ,

N S N v
vS

and

N S N v . The degree of a vertex x denotes the

vS

number of neighbors of
degree of G . Also

x in G and G is the maximum

is the minimum degree of

G. A

S of vertices in G is a dominating set, if

N S V G . The domination number G of G is
the minimum cardinality of a dominating set. If S is a subset
of V G , then we denote by S , the subgraph induced by
set

S . A subset S of vertices is independent, if S has no

edge. For notation and graph theory terminology in general we
follow [2] or [6].
A Spider is a tree with the property that the removal of all the
end paths of length two of T results in an isolated vertex

called a head of a spider and the end vertices are called the
foot vertices.

u S . We say that a vertex v

u with respect to S if
N v S u . The private neighbor set of u with

Let S be a set of vertices and

is a private neighbor of

respect to
A

S is the set pn u, S v; N v S u .

Roman

dominating

function

(RDF)

on

graph

G V , E is a function f : V 0,1, 2 satisfying the

u V for which f u 0 is
adjacent to at least one vertex v V for which f (v) 2 .
condition that every vertex

The weight of a Roman dominating function is the

value

f (V ) f (v) . The Roman domination number

R G

vV

G is the minimum weight of a Roman

dominating function on G .See [4] and [5].
of

A function

f V0 ,V1 ,V2 is called connected Roman

dominating function (CRDF) of

G if either V1 V2 or

__________________________________________________________________________________________
Volume: 02 Issue: 10 | Oct-2013, Available @ http://www.ijret.org

333

IJRET: International Journal of Research in Engineering and Technology

V2 is connected. The connected Roman domination number

RC G

of

G is the minimum weight of a CRDF of G .

Independent Roman dominating functions were studied by

Adabi et.al in [1]. A Roman dominating function

f V0 ,V1 ,V2 in a graph G is independent RDF or

simply IRDF, if

V1 V2 is independent. The independent

Roman domination number

iR G of G is the minimum

weight of an IRDF of G .

eISSN: 2319-1163 | pISSN: 2321-7308

RC Km,n 2 0 .

6.

Theorem 2:
Let

f V0 ,V1 ,V2 be a RC - function of G . Then V2 is a

-set of G if for each vertex v V1 is adjacent to at least

one vertex of V2 or the set V1 .
f V0 ,V1 ,V2 be a RC function of G .

Proof: Let

v1, v2 ,........., vn ,1 n p be the -set and

DC v1 , v2 ,......, vn where 1 i p be the c -set of

Further D

In this paper we establish the new concept called connected

Roman domination number of G defined by M. H.
Muddebihal and Sumangaladevi. The purpose of this paper is
to initialize the study of CRDF which gives one of the direct
application of minimal CRDF is to win the war. For this we
need the continuous flow of communication between the army
troops by supply of requirements with minimum cost, by
placing weight 1 between the non adjacent vertices of V1 and

V2 or V2 , which yields a minimal CRDF.

G.

If V1

then

M v1 , v2 ,......., v j

M V DC .

there

exists

where

1 j n

vertex

set

such

that

M V0

Hence

M V0 V1 V2 . Now for every vertex set

S ui ;1 i n and ui DC V2 , we have S V1 .

and N

Suppose

there

exists

at

least

one

vertex

of

2. RESULTS

wi ;1 i n V1 such that N wi V2 . Then f is a

Specific values of Connected Roman domination numbers for

some class of graphs

RC -

In this section we illustrate the connected Roman domination

number by determining the value of

RC G

for several

classes of graphs.

G with V1 V2 as a -set of G , a
contradiction. Hence for each vertex v S must be adjacent
to at least one vertex of V2 , which gives f as a RC function with V2 as a -set of G . If V1 .
function of

D DC Hence f is a RC -function with V2 as a

-set of G .

Then

Theorem 1:
For the class of paths Pp , cycles C p , wheels W p , stars K1, p ,
complete graphs K p , and complete bipartite graphs K m , n . We
have
1.

RC Pp p

Theorem 3
For any non-trivial tree T ,

if

p 2.

p 1
if p 3 .
2
2. RC C p p 1 if p 3 .
3.
4.
5.

if

p 3.

RC Wp 1 .

RC K1, p 0 1 .

RC K p 1 .

if and only if

every non end vertex of T is adjacent to at least one end

vertex.

=p

RC T 2 T

Proof: Let

H1 vi ;1 i p and H 2 v j ;1 j p

be the set of non end vertices adjacent to at least one end

vertex and the set of non end vertices which are not adjacent
to end vertex respectively. Let
function of G . Suppose H 2
and

C -set of G

Case 1: Suppose

f V0 ,V1 ,V2 be a RC -

. Let D and DC be a -set

respectively. Then we have following cases.

H 2 1 or 2. Then we have two sub cases.

__________________________________________________________________________________________
Volume: 02 Issue: 10 | Oct-2013, Available @ http://www.ijret.org

334

IJRET: International Journal of Research in Engineering and Technology

Subcase 1.1: Assume H 2

1 . Let

u H 2 such that
u D which gives

u N H1 . Then u V1 but
that RC T 2 T , a contradiction.

v1 , v2 H 2 such that
v1 , v2 N H1 . Then v1 , v2 V1 but v1 , v2 D ,
which gives RC T 2 T , a contradiction.
Subcase 1.2: Assume

Case 2: Suppose

H 2 2 and

H 2 k and vk ;3 k n H 2 . Then

vl ;1 l n vk , vl V1 . But

v v D which
l

3l

gives,

v3l D and
RC T T again a

contradiction.
For the converse from the above all cases, let

H 2 . Then

vi V2 D DC .

Hence

Rc T 2 V2 V1 2 DC 2 D 2 T .

eISSN: 2319-1163 | pISSN: 2321-7308

f V0 ,V1 ,V2 be a RC -function of G . Since

Proof: Let

V2 dominates V0 , the connected induced subgraph of

V1 V2 is a CRDF of G .

Therefore,

G V1 V2 V1 2 V2 RC G .

Now we consider the following cases to establish the upper

RC G . Let D and DC be a -set and C -set

respectively in G . Then we have following cases.
bound for

Case 1: Suppose

S2 v1 , v2 ,......, vi , 1 i n be the set of nonend

vertices which are adjacent to at least one end vertex and the
set of nonend vertices which are not adjacent to end vertices
respectively.

Then

any

connected

graph

with

p3

vertices,

G
RC G
p 1 .
2
Proof: Let
Further
the

f V0 ,V1 ,V2 be a RC -function of G .

D vi ;1 i n and DC v j ;1 j n be

-set and C -set of G respectively such that D D C .

ui D has at least one private neighbor in

V D C . Then ui V2 and ( DC ui ) V1 . Suppose
there exists vi D with no neighbor in V D C .
Then vi V1
Suppose

G
Hence RC G
V1 2 V2 1 p 1
2

Theorem 5:
For any graph G ,

G RC G 3 G .

S1 V2

S2 V1

and

V0 V S1 S2 .
Hence

RC G V1 V2 V1 2 V2 3 D 3 G .

Theorem 4:
For

G is a tree. Let S1 v1 , v2 ,......, vn and

Case 2: Suppose

G is not a tree and N v1 , v2 ,......, vn

be the set of all end vertices. Then we have following

subcases.
Assume N ,

Subcase2.1:

let

H1 v1 , v2 ,......, vk DC S2 be the set nonend

vertices with at least one private neighbor in

V DC and

H 2 DC S2 be the set of nonend vertices with no private

neighbor in V DC . Then ( S1 H1 ) V2 and H 2 V1 .
Hence

RC G V1 V2 V1 2 V2 3 D 3 G .

Subcase2.2:

Assume N .

Then S1

Let

H1 , H 2 DC S2 such that H1 has at least one private

neighbor in V DC and H 2 has no private neighbor in
V DC . Clearly H 2 V1 and H1 V2 .
Hence RC

G V1 V2

V1 2 V2 3 D 3 G

__________________________________________________________________________________________
Volume: 02 Issue: 10 | Oct-2013, Available @ http://www.ijret.org

335

IJRET: International Journal of Research in Engineering and Technology

Theorem 6:

hence

RC T iR T

For any tree T ,

if and only if every

nonend vertex of T is adjacent to exactly two end vertices or

if every nonend vertex of T is adjacent to at least three
vertices, then they are not adjacent.

there

eISSN: 2319-1163 | pISSN: 2321-7308

exists

w V2 . Clearly
RC T iR T .

w N x N y
V1 V2 V1' V2' .

such

that
Hence

Theorem 7:
Proof: Suppose there exists at least one nonend vertex of T ,
which is adjacent to only one end vertex. Let I be the
minimal independent Roman dominating set of T and

Let G K m1 ,m2 ,m3 ,........, mn be the complete

with

m1 m2 ........ mn .

I1 , I 2 I with I1 V1 and I 2 V2 . Then each vertex

a. If

m1 1 , then RC G 2 .

I 2 V2 in iR T and RC T . But I1 V1 and

b. If

m2 2 , then RC G 4 .

f V0 ,V1 ,V2 be a RC -function of T . Further let

of

N ( I1 ) V0 in iR T , whereas N ( I1 ) V2 and I1 V0 in

RC T , which gives RC T iR T , a contradiction.

Suppose

there

exists

nonend

vertex

set

vi ;1 i n adjacent to at least three end vertices such that

at least two vertices of vi are adjacent and N be the set
of end vertices of T . Let A vi . Then each vertex of
A V2 in RC T . But for the pair of adjacent vertices
u, v A with deg u deg v , we have u V2 , v V0
and {N v N } V1 in iR T . Since each vertex of A
is adjacent to at least three end vertices, deg v 3 which
gives, RC T iR T , a contradiction.
Conversely, let

f V0 ,V1 ,V2 be a RC -function of T

and f V0 ,V1 ,V2 be a

'

'

'

'

iR T - function of T . Assume

Proof: a. This case is obvious.

b. Let M be the partite set of size

n -partite graph

m1 and N V M ,

u M and v N such that f u f v 2 .

While every other vertex w is in either M or N , let
f w 0 . If there exists a vertex w M V0 , then there
further

must exists a vertex

x N V2 . If there also exists a vertex

y V0 N x , then there must exists a vertex

z {V2 (M w)} . Since f is an CRDF, we have

RC G 4 .
Theorem 8:
Let

Then

T t T RC T

be

any

tree

with

p3

vertices.

Proof: Let T be any tree with p 3 vertices. Suppose

statement of the Theorem holds. Let I be the minimal

D v1 , v2 ,......, vn and Dt v1 , v2 ,......, vi where

independent Roman dominating set of T . Further

1 i n be the -set and t -set of G respectively. Then

n1

and

be the set of non end vertices and end vertices

S1 , S2 n1
'
'
'
such that S1 V2 and S2 V0 . If S1 V2 .
'
Then S1 V2 . If S2 V0 . Then for each
ui S2 , there exists exactly two neighbors
x, y N (ui ) N such that x y V1' . Since
'
each ui of S 2 has exactly two neighbors x, y in V1 ,
respectively. Then

n1 V2'

'

or V0 . Let

ui D Dt of T adjacent to at
least one end vertex such that ui V2 and also there may
exists a nonend vertex set vi V ({ui } V0 ) which are
not adjacent to end vertex such that vi V1 .Which gives,
D Dt V1 V2 . Hence T t T RC T .
there exists a vertex set

__________________________________________________________________________________________
Volume: 02 Issue: 10 | Oct-2013, Available @ http://www.ijret.org

336

IJRET: International Journal of Research in Engineering and Technology

Subcase 1.2: Assume

Theorem 9:
Let

eISSN: 2319-1163 | pISSN: 2321-7308

G be any graph with G C G . Then

RC G G C G .
Proof: It is sufficient to prove this result for any connected
graphs G . Let G be any connected graph with

G C G and D v1 , v2 ,......, vn be the set of

vertices of G which forms -set for G . Since
G C G . Hence D also forms a connected
dominating set of

G . Suppose f V0 ,V1 ,V2 is a CRDF of

G . Then V0 V D , V1 and D V2 . Hence

RC G V1 2 V2 2 D D D G C G
.
Observation: For any graph

uk which are adjacent in G . Then

uk V0' or V2' . If uk V0' . Then there exists
vi N uk V DC such that vi V1' . But
uk V2 and vi V0 , which gives, RC G R G ,
'
a contradiction. If uk V2 , then there exists at least two
'
vertices of u j N uk DC such that u j V0 .
two vertices of

But

every uk u j V1 ,

for

which

gives

RC G R G , a contradiction.
Case 2: Suppose there exists at least one vertex
has no neighbors in

G , R G RC G .

uk ;1 k n , there exists at least

wi which

V DC . Then wi V0' or V1' or V2' .

wi V0' . Then wi V1 , again RC G R G , a

'
'
contradiction. If wi V1 or V2 . Then there exists at least
'
two vertices of w j N wi such that w j V0 . But
wj N wj V1 , which gives RC G R G , a
If

Theorem 10:
Let

be

any

RC G R G

connected

p, q

graph.

if and only if every vertex

has at least two private neighbors in

vi

Then
of

DC

V DC , where DC is a

C -set of G .
Proof: Let

f V0 ,V1 ,V2 and g V ,V ,V be a

RC -function

and

'
0

R -function

of

'
1

'
2

G respectively. Assume

DC v1 , v2 ,.......vn be a C -set of G . Then we consider

the following cases.

Case 1: Suppose there exists at least one vertex
with exactly one private neighbor in

ui of

DC

V DC . Then for every

uk ui , we consider following sub cases.

uk are adjacent in
'
G . Then uk V0 and N uk V DC V1' . But
uk V2 and N uk V DC V0 , which gives,
RC G R G , a contradiction.

Subcase 1.1: Assume no two vertices of

contradiction.

RC G R G ,

Hence in all cases, we have

contradiction.
Conversely, let every vertex
private

neighbors

vi

V DC .

in

N (vi ) V DC V0 ,
N (vi ) V DC V0' .
Hence

of

DC has at least two

Then

also

vi V2 and

vi V2'

and

RC G V1 V2 V1' V2' R G .

We need the following Theorem to prove further Theorem

Theorem A [2]:
For

any

connected

graph

G with

G p 1 ,

G t G C G .

__________________________________________________________________________________________
Volume: 02 Issue: 10 | Oct-2013, Available @ http://www.ijret.org

337

IJRET: International Journal of Research in Engineering and Technology

Theorem 11:
Let

Proof: We consider a minimal connected dominating set

G be any connected graph with G p 1 .

Then RC

G C G t G

Proof: Let
Suppose DC

f V0 ,V1 ,V2 be a RC -function of G .

v1 , v2 ,......., vn

and

Dt v1 , v2 ,......., vi , where 1 i n be the C -set and

t -set respectively. Then t G C G . We consider the

following cases.

t G C G .

Case 1: Suppose

Then

{DC } V2 or

(V1 V2 ) and {V DC } V0 . Again we consider the

following subcases.
Subcase 1.1:

Assume

DC V2 . Then V1 and

V DC V0 .
Hence

RC G 2 V2 2 DC DC Dt C G t G

of

Subcase 1.2: Assume

DC V1 V2 .

G . Hence DC V1 V2 . Suppose V1 . Then

{DC } V2 ,

which

V1 .

Suppose

V2 DC .

gives

RC G 2 V2 2 DC

. Hence

Then

Clearly

RC G 2 C G .

V1 V2 DC .

Clearly

RC G V1 2 V2 2 V1 2 V2 2 V1 V2 2 DC
. Hence RC G 2 C G . Thus RC G 2 C G
Theorem 13:

G be any connected graph. If DRC is a minimal

connected Roman dominating function of G and for every
vi DRC there exists at least one vertex of
Let

N vi V DRC .
Then

V DRC is Roman dominating function of G

function of

DRC be a minimal connected Roman dominating

G . Suppose for each vi DRC , there exists at

least one vertex

V DC V0 .

DC

G . Since each vertex of DC connected dominating set of

Proof: Let

Then

eISSN: 2319-1163 | pISSN: 2321-7308

Then

ui

ui N vi

is not dominated by

such that

ui V DRC .

V DRC . Hence V DRC

is not a RDF of G . Thus for each vi DRC , there exists at

RC G 2 V2 V1 2 V2 V1 2 DC DC Dt C G t G
least one vertex of N vi V DRC . Clearly DRC is a

Thus
.

Case 2: Suppose

t G C G , let vi Dt DC .

vi V2 or V1 and DC vi V1 .
t G C G . Hence there exists at least one
v j vi and v j DC such that v j V1 .

Then

vertex

G 2 C G

Roman

dominating

function

and

G is said to be Roman connected graph

RC G 2 G .

Now we characterize the Roman connected graphs in the

following Theorem.

Theorem 14:

G is Roman connected graph if and only if it has a

RC -function f V0 ,V1 ,V2 with V1 .

A graph

Theorem 12:
Then RC

Definition: A graph
if

RC G 2 V2 V1 DC Dt C G t G .
f V0 ,V1 ,V2

connected

V DRC is Roman dominating function of G .

Since

Hence

Let

minimal

be

RC -function

of

G.

Proof: Let

G be a graph and f V0 ,V1 ,V2 be a RC -

function of

G . If V1 , by definition of RC G , V2

__________________________________________________________________________________________
Volume: 02 Issue: 10 | Oct-2013, Available @ http://www.ijret.org

338

IJRET: International Journal of Research in Engineering and Technology

eISSN: 2319-1163 | pISSN: 2321-7308

dominates

V2 G . Any other arrangement of weight 2 G

of

would have

V V2 . Otherwise a connected induced subgraph

V1 V2 dominates V (V1 V2 ) and hence

G V1 V2 V1 V2 V1 2 V2 Rc G .
We consider the following cases.

V1 and D be a -set of G . Let

Case 1: Suppose

and v D .

v V1

For 1, since

2 G 2 V1 V2 ,

Then

contradiction.

V1 and v D . Then there exists at

Case 2: Suppose

ui N v such that ui V1 and

gives again, 2 G 2 V1 V2 , a

which

vertex of degree 1.

Since

Thus

f V0 ,V1 ,V2 be a RC -function of G

V2 is a -set of G such that V2 G .

RC G 2 V2 2 G .

Hence

G is

Roman

connected graph.

For any connected graph

RC G 2 G

with

if and only if

p 2 vertices,

v V with degree

p G .

such

that

Theorem 16:
Let T be any tree with every nonend vertex of T is adjacent
to at least one end vertex. Then

RC T 2C , where C

is

the set of cut vertices of T .

f V0 ,V1 ,V2 be a RC -function of T . Since

each nonend vertex of T is adjacent to at least one end vertex.
By definition of RC G , there exists a connected Roman
dominating set
that

G has a vertex v with degree p G

v V G . If

V2 v ,

V1

V0 V v . Then V2 is a -set of

RC G 2 G
function of G .
In order to CRDF

for connected graphs,

DRC V2 and N DRC N V0 such

V1 , where C and N are the set of cut vertices and

end vertices of T respectively. Clearly

C V2 . Hence

RC T 2 V2 2C .

and
and

f V0 ,V1 ,V2 is an CRDF with f V 2 G . Since

either 1.

G joins V2 and V2 . Hence

Proof: Let

Theorem 15:

Proof: Suppose

2 G with V1 and V2 G . Since

deg(v) V0 p V1 V2 p V2 p G .

V1 . Therefore RC G 2 V2 . Since V1 ,

by Theorem 2,

f V0 ,V1 ,V2 be a RC -function for G of

V1 , each edge of

G is Roman connected. Then V1 .

Conversely, let
with

For 2, Let
weight

contradiction.

V2 . Then V1 V . By a Theorem of Ore

p
for a connected graph G on p vertices.
2
p
Thus p G 1 1 , which implies that p 2 . It
2
is easily verified that RC P2 2 2 P2 and P2 has a
[3],

least two neighbors of

ui D ,

V1 V2 2 G .

REFERENCES
[1]

f is a RC -

f V0 ,V1 ,V2 to have weight 2 G

V1 G 1 and V2 or 2. V1 and

[2]
[3]

M. Adabi, E. Ebrahimi Targhi, N. Jafari and M. Said

Moradi, Properties of independent Roman domination
in graphs, Australasian Journal of Combinatorics,
52(2012),11-48.
T.W. Haynes, S. T. Hedetniemi and P. J. Slater,
Fundamentals of Domination in graphs, Marcel Dekker,
New York, (1998).
O. Ore, Theory of graphs, Amer. Math. Soc. Colloq.
Publ.,38, providence, (1962).

__________________________________________________________________________________________
Volume: 02 Issue: 10 | Oct-2013, Available @ http://www.ijret.org

339

IJRET: International Journal of Research in Engineering and Technology

[4]
[5]
[6]

eISSN: 2319-1163 | pISSN: 2321-7308

C. S Revelle, K. E. Rosing, Defendens imperium

Romanum; a classical problem in military strategy,
Amer. Math. Monthly,107(2007),585-594.
I. Stewart, Defend the Roman Empire!, Sci. Amer,
281(6)(1999), 136-139.
D. B. West, Introduction to graph theory, ( 2
Prentice Hall, USA (2001).

nd

edition),

__________________________________________________________________________________________
Volume: 02 Issue: 10 | Oct-2013, Available @ http://www.ijret.org

340