Escolar Documentos
Profissional Documentos
Cultura Documentos
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
RC G
of
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
set S
V G ,
N S N v
vS
and
number of neighbors of
degree of G . Also
G. A
called a head of a spider and the end vertices are called the
foot vertices.
respect to
A
S is the set pn u, S v; N v S u .
Roman
dominating
function
(RDF)
on
graph
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
R G
vV
A function
G if either V1 V2 or
__________________________________________________________________________________________
Volume: 02 Issue: 10 | Oct-2013, Available @ http://www.ijret.org
333
RC G
of
simply IRDF, if
iR G of G is the minimum
weight of an IRDF of G .
RC Km,n 2 0 .
6.
Theorem 2:
Let
Proof: Let
Further D
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
and N
Suppose
there
exists
at
least
one
vertex
of
2. RESULTS
RC -
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
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
=p
RC T 2 T
Proof: Let
H1 vi ;1 i p and H 2 v j ;1 j p
C -set of G
Case 1: Suppose
f V0 ,V1 ,V2 be a RC -
__________________________________________________________________________________________
Volume: 02 Issue: 10 | Oct-2013, Available @ http://www.ijret.org
334
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 .
Proof: Let
V1 V2 is a CRDF of G .
Therefore,
G V1 V2 V1 2 V2 RC G .
Case 1: Suppose
Then
any
connected
graph
with
p3
vertices,
G
RC G
p 1 .
2
Proof: Let
Further
the
D vi ;1 i n and DC v j ;1 j n be
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
Case 2: Suppose
Subcase2.1:
let
V DC and
RC G V1 V2 V1 2 V2 3 D 3 G .
Subcase2.2:
Assume N .
Then S1
Let
G V1 V2
V1 2 V2 3 D 3 G
__________________________________________________________________________________________
Volume: 02 Issue: 10 | Oct-2013, Available @ http://www.ijret.org
335
Theorem 6:
hence
RC T iR T
there
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
m1 m2 ........ mn .
a. If
m1 1 , then RC G 2 .
b. If
m2 2 , then RC G 4 .
of
N ( I1 ) V0 in iR T , whereas N ( I1 ) V2 and I1 V0 in
there
exists
nonend
vertex
set
'
'
'
iR T - function of T . Assume
n -partite graph
m1 and N V M ,
RC G 4 .
Theorem 8:
Let
Then
T t T RC T
be
any
tree
with
p3
vertices.
n1
and
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
Theorem 9:
Let
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
RC G V1 2 V2 2 D D D G C G
.
Observation: For any graph
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 .
wi which
Theorem 10:
Let
be
any
RC G R G
connected
p, q
graph.
vi
Then
of
DC
V DC , where DC is a
C -set of G .
Proof: Let
RC -function
and
'
0
R -function
of
'
1
'
2
G respectively. Assume
ui of
DC
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.
contradiction.
RC G R G ,
contradiction.
Conversely, let every vertex
private
neighbors
vi
V DC .
in
N (vi ) V DC V0 ,
N (vi ) V DC V0' .
Hence
of
also
vi V2 and
vi V2'
and
RC G V1 V2 V1' V2' R G .
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
Theorem 11:
Let
Then RC
G C G t G
Proof: Let
Suppose DC
and
t G C G .
Case 1: Suppose
Then
{DC } V2 or
Assume
DC V2 . Then V1 and
V DC V0 .
Hence
RC G 2 V2 2 DC DC Dt C G t G
of
DC V1 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:
N vi V DRC .
Then
function of
V DC V0 .
DC
Proof: Let
Then
Then
ui
ui N vi
is not dominated by
such that
ui V DRC .
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
RC G 2 G .
Theorem 14:
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
Since
Hence
Let
minimal
be
RC -function
of
G.
Proof: Let
function of
G . If V1 , by definition of RC G , V2
__________________________________________________________________________________________
Volume: 02 Issue: 10 | Oct-2013, Available @ http://www.ijret.org
338
dominates
of
would have
G V1 V2 V1 V2 V1 2 V2 Rc G .
We consider the following cases.
Case 1: Suppose
and v D .
v V1
For 1, since
2 G 2 V1 V2 ,
Then
contradiction.
Case 2: Suppose
which
vertex of degree 1.
Since
Thus
RC G 2 V2 2 G .
Hence
G is
Roman
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
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
C V2 . Hence
RC T 2 V2 2C .
and
and
either 1.
Proof: Let
Theorem 15:
Proof: Suppose
deg(v) V0 p V1 V2 p V2 p G .
V1 . Therefore RC G 2 V2 . Since V1 ,
by Theorem 2,
V1 , each edge of
Conversely, let
with
For 2, Let
weight
contradiction.
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],
ui D ,
V1 V2 2 G .
REFERENCES
[1]
f is a RC -
V1 G 1 and V2 or 2. V1 and
[2]
[3]
__________________________________________________________________________________________
Volume: 02 Issue: 10 | Oct-2013, Available @ http://www.ijret.org
339
nd
edition),
__________________________________________________________________________________________
Volume: 02 Issue: 10 | Oct-2013, Available @ http://www.ijret.org
340