International Journal of Applied Engineering

Research and Development (IJAERD)

ISSN(P): 2250-1584; ISSN(E): 2278-9383
Vol. 4, Issue 1, Feb 2014, 53-62
TJPRC Pvt. Ltd.

TO FIND THE COMPARISON OF THE RADIUS WITH THE RAINBOW CONNECTION
NUMBER OF INTERVAL GRAPHS
A. SUDHAKARAIAH, E. GNANA DEEPIKA, V. RAMA LATHA & T. VENKATAESWARLU
Department of Mathematics, S. V. University, Tirupati, Andhra Pradesh, India

ABSTRACT
Graph coloring takes its name from the map coloring application, we assign labels to vertices. When the
numerical value of the labels is unimportant, we call them colors to indicate that, they may be elements of any set. In graph
theory, a connected component of an undirected graph is a sub graph in which any two vertices are connected to each other
by paths. The rainbow connection number of a connected graph is the minimum number of colors needed to color its
edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same.
In this paper we show that the rainbow connection number of an interval graph, which are of the form the rainbow
connection number is equal to the radius of the graph G plus three.
KEYWORDS: Radius, Eccentricity, Interval Graph, Rainbow Connection Number, Rainbow Path
INTRODUCTION
A Graph ( , ) G V E = is an interval graph, if the vertex set V can be put into one-to-one correspondence with a
set of intervals I on the real line R , such that two vertices are adjacent in G if and only if their corresponding intervals
have non-empty intersection. The set I is called an interval representation of G and G is referred to as the intersection
graph . I The intervals
1 2
{ , ,....., }
n
I i i i = be an interval family, where each
i
i is an interval on the real line and
[ , ]
i i i
i a b = for 1, 2,....., , i n = here
i
a is called left end point labeling and
i
b is the right end point labeling of
i
i .
Without loss of generality we assume that all end points of the interval in I are distinct numbers between 1 and 2n.
Two intervals i and j are said to be intersect each other if they have non-empty intersection. An edge color of a graph is
a function from its edge set to the set of natural numbers. A path in an edge colored graph with no two edges sharing the
same color is called a Rainbow Path. An edge colored graph is said to be rainbow connected if every pair of vertices is
connected by at least one rainbow path, such a color is called a rainbow color of the graph.
The minimum number of colors required to a connected graph is called its rainbow connection number [1, 2, 5],
denoted by ( ). rc G In graph theory, the rainbow connection number of a complete graph is one, that of a path is its length,
that of an even cycle is its diameter. The radius of a graph G is the minimum of eccentricity of all its vertices and is
denoted by rad(G) [3] that is rad(G)=min{eec(V):VeV(G)}, where the maximum distance from a vertex u to any vertex
of G is called eccentricity of the vertex v and is denoted by ( ), ecc v that is ( ) max{ ( , ) : ( )}, ecc v d u v u V G = e
where as the distance between two vertices u and v of a graph is the length of the shortest path between them and is
denoted by ( , )
G
d u v or ( , ) d u v . To the rainbow colored graph it is enough to ensure that every edge of some spanning
tree in the graph gets a distinct color. Hence it is an interval graph with minimum degree ( ) G o [4] is two and the radius
rad (G).

54 A. Sudhakaraiah, E. Gnana Deepika, V. Rama Latha & T. Venkataeswarlu
MAIN THEOREMS
Theorem
Let
1 2
{ , ,....., }
n
I i i i = be an interval family and G is an interval graph with ( ) 2 G o > corresponding to I. If i
and j are any two intervals in I such that 1 j = , i

is a dominating interval and j is contained in i , there is at least one
interval i l = to the left of j that intersects j or i and there is at least two intervals one is k i = to the right of j that
intersects j or i and another interval is the another dominated interval which intersects i only then the rainbow connection
number
. 3 ) ( ) ( + = G rad G rc
Proof
Let
1 2
{ , ,....., }
n
I i i i = be an interval family and G is an interval graph with ( ) 2 G o > corresponding to I. If i
and j are any two intervals in I such that 1 j = , i

is a dominating interval and j is contained in i , there is at least one
interval i l = to the left of j that intersects j or i and there is at least two intervals one is k i = to the right of j that
intersects j or i and another interval is the another dominated interval which intersects i only. Of course the dominated
interval i contains the interval j, then the intervals l and k must intersects the dominated interval i. If we assign the colors to
the edges in the corresponding interval graph G, then we get the rainbow connection number rc(G), it must be greater than
the minimum value of the distances of every pair of vertices in the corresponding interval graph G, then rc(G) = rad(G)+3.
If the intervals l and k both are not intersecting the interval j but not i and another interval which is to the right of j
excluding k, i.e., the dominated interval which is to the right of j still intersects the interval i only then there is no change in
the number of intervals which are intersecting the dominated interval i. So, the rainbow connection number and the
minimum value of the distances of every pair of vertices remain same. Then in this case also rc(G) = rad(G)+3. This can
be verified in the following interval family clearly. Consider the following Interval family I as follows,

Figure 1: Interval Family I
As a contradiction, let us suppose that, there is no interval l i to the left of j that intersects j and to the right of j
there is no another dominated interval which intersects i, then the corresponding interval family is as follows,

Figure 2: Interval Family I
In this interval family we can easily see that rc (G) < rad (G)+3.
Hence our assumption that, there is no interval l i to the left of j that intersect j and to the right of j, there is no
another dominated interval which intersect i is wrong. So, if i and j are any two intervals in I such that j i, i is a
1
4
7
10
2
6 8
3
5
9
1 4 7 10
2 6 8
3
5
9
To Find the Comparison of the Radius with the Rainbow Connection Number of Interval Graphs 55
dominated interval and j is contained in i, there is aatleast one interval l i to the left of j that intersects j or i and there is
atleast two intervals one is k i to the right of j that intersects j or i and another interval is the another dominated interval
which intersects i only, then rc(G) = rad(G)+3, which can be shown in the following illustration clearly. Now, consider
the following interval family I as follows,

Figure 3: Interval Family I
The corresponding neighborhoods of each vertex from the above interval family I are as follows,
nbd [ 1 ] = {1,2,3}, nbd [ 2 ] = {1,2,3,4}, nbd [ 3 ] = {1,2,3,4,6}, nbd [ 4 ] = {2,3,4,5,6}, nbd [ 5 ] = {4,5,6,7}, nbd
[ 6 ] = {3,4,5,6,7,9}, nbd [ 7 ] = {5,6,7,8,9}, nbd [ 8 ] = {7,8,9,10}, nbd [ 9 ] = {6,7,8,9,10}, nbd [ 10 ] = {8,9,10}
The rainbow edge colors as follows from the interval graph G corresponding to the interval family I. Let us
assume that I = {1, 2,..,9} = {v
1
, v
2
,,v
9
}.
C(v
1
,v
2
) = 1, C(v
1
,v
3
) = 2, C(v
2
,v
3
) = 3, C(v
2
,v
4
) = 2, C(v
3
,v
4
) = 1, C(v
3
,v
6
) = 4, C(v
4
,v
5
) = 4, C(v
4
,v
6
) = 3, C(v
5
,v
6
)
= 2, C(v
5
,v
7
) = 3, C(v
6
,v
7
) = 1, C(v
6
,v
9
) = 5, C(v
7
,v
8
) = 2, C(v
7
,v
9
) = 4, C(v
8
,v
9
) = 1, C(v
8
,v
10
) = 3, C(v
9
,v
10
) = 2
Therefore the set of colors are, C={1, 2, 3, 2, 1, 4, 4, 3, 2, 3, 1, 5, 2, 4, 1, 3, 2}= {1,2,3,4,5}
The Rainbow connection number rc (G) = 5.
The distances of the path lengths from the interval graph G are as follows,
Table 1
d(v
1
,v
1
)=0 d(v
2
,v
1
)=1 d(v
3
,v
1
)=1 d(v
4
,v
1
)=2 d(v
5
,v
1
)=3
d(v
1
,v
2
)=1 d(v
2
,v
2
)=0 d(v
3
,v
2
)=1 d(v
4
,v
2
)=1 d(v
5
,v
2
)=2
d(v
1
,v
3
)=1 d(v
2
,v
3
)=1 d(v
3
,v
3
)=0 d(v
4
,v
3
)=1 d(v
5
,v
3
)=2
d(v
1
,v
4
)= 2 d(v
2
,v
4
)=1 d(v
3
,v
4
)=1 d(v
4
,v
4
)=0 d(v
5
,v
4
)=1
d(v
1
,v
5
)= 3 d(v
2
,v
5
)=2 d(v
3
,v
5
)=2 d(v
4
,v
5
)=1 d(v
5
,v
5
)=0
d(v
1
,v
6
)= 2 d(v
2
,v
6
)=2 d(v
3
,v
6
)=1 d(v
4
,v
6
)=1 d(v
5
,v
6
)=1
d(v
1
,v
7
)= 3 d(v
2
,v
7
)=3 d(v
3
,v
7
)=2 d(v
4
,v
7
)=2 d(v
5
,v
7
)=1
d(v
1
,v
8
)= 4 d(v
2
,v
8
)=4 d(v
3
,v
8
)=3 d(v
4
,v
8
)=3 d(v
5
,v
8
)=2
d(v
1
,v
9
)= 3 d(v
2
,v
9
)=3 d(v
3
,v
9
)=2 d(v
4
,v
9
)=2 d(v
5
,v
9
)=2
d(v
1
,v
10
)=4 d(v
2
,v
10
)=4 d(v
3
,v
10
)= 3 d(v
4
,v
10
)=3 d(v
5
,v
10
) =3
d(v
6
,v
1
)= 2 d(v
7
,v
1
)=3 d(v
8
,v
1
)=4 d(v
9
,v
1
)=3 d(v
10
,v
1
)=4
d(v
6
,v
2
)= 2 d(v
7
,v
2
)=3 d(v
8
,v
2
)=4 d(v
9
,v
2
)=3 d(v
10
,v
2
)=4
d(v
6
,v
3
)= 1 d(v
7
,v
3
)=2 d(v
8
,v
3
)=3 d(v
9
,v
3
)=2 d(v
10
,v
3
)=3
d(v
6
,v
4
)= 1 d(v
7
,v
4
)=2 d(v
8
,v
4
)=3 d(v
9
,v
4
)=2 d(v
10
,v
4
)=3
d(v
6
,v
5
)= 1 d(v
7
,v
5
)=1 d(v
8
,v
5
)=2 d(v
9
,v
5
)=2 d(v
10
,v
5
)=3
d(v
6
,v
6
)= 0 d(v
7
,v
6
)=1 d(v
8
,v
6
)=2 d(v
9
,v
6
)=1 d(v
10
,v
6
)=2
d(v
6
,v
7
)= 1 d(v
7
,v
7
)=0 d(v
8
,v
7
)=1 d(v
9
,v
7
)=1 d(v
10
,v
7
)=2
d(v
6
,v
8
)= 2 d(v
7
,v
8
)=1 d(v
8
,v
8
)=0 d(v
9
,v
8
)=1 d(v
10
,v
8
)=1
d(v
6
,v
9
)= 1 d(v
7
,v
9
)=1 d(v
8
,v
9
)=1 d(v
9
,v
9
)=0 d(v
10
,v
9
)=1
d(v
6
,v
10
)= 2 d(v
7
,v
10
)=2 d(v
8
,v
10
)=1 d(v
9
,v
10
)=1 d(v
10
,v
10
)=0

The eccentricities of the vertices are as follows,
( )
( ) max ( , )
x V G
ecc v d v x
e
=

ecc(v
1
) = max {d(v
1
,v
1
), d(v
1
,v
2
), d(v
1
,v
3
), d(v
1
,v
4
), d(v
1
,v
5
),d(v
1
,v
6
),d(v
1
,v
7
),d(v
1
,v
8
), d(v
1
,v
9
), d(v
1
,v
10
)}= max
{0,1,1,2,3,2,3,4,3,4} = 4
1
4 7 10
2
6
8
3 5 9
56 A. Sudhakaraiah, E. Gnana Deepika, V. Rama Latha & T. Venkataeswarlu
ecc(v
2
) = max {d(v
2
,v
1
), d(v
2
,v
2
), d(v
2
,v
3
), d(v
2
,v
4
), d(v
2
,v
5
), d(v
2
,v
6
), d(v
2
,v
7
), d(v
2
,v
8
), d(v
2
,v
9
), d(v
2
,v
10
)}= max
{1, 0, 1, 1, 2, 2, 3, 4, 3, 4} = 4
ecc(v
3
) = max {d(v
3
,v
1
), d(v
3
,v
2
), d(v
3
,v
3
), d(v
3
,v
4
), d(v
3
,v
5
), d(v
3
,v
6
), d(v
3
,v
7
), d(v
3
,v
8
), d(v
3
,v
9
), d(v
3
,v
10
)}= max
{1, 1, 0, 1, 2, 1, 2, 3, 2, 3} = 3
ecc(v
4
) = max {d(v
4
,v
1
), d(v
4
,v
2
), d(v
4
,v
3
), d(v
4
,v
4
), d(v
4
,v
5
), d(v
4
,v
6
), d(v
4
,v
7
), d(v
4
,v
8
), d(v
4
,v
9
), d(v
4
,v
10
)}= max
{2, 1, 1, 0, 1, 1, 2, 3, 2, 3} = 3
ecc(v
5
) = max {d(v
5
,v
1
), d(v
5
,v
2
), d(v
5
,v
3
), d(v
5
,v
4
), d(v
5
,v
5
), d(v
5
,v
6
), d(v
5
,v
7
), d(v
5
,v
8
), d(v
5
,v
9
), d(v
5
,v
10
)}= max
{3, 2, 2, 1, 0, 1, 1, 2, 2, 3} = 3
ecc(v
6
) = max {d(v
6
,v
1
), d(v
6
,v
2
), d(v
6
,v
3
), d(v
6
,v
4
), d(v
6
,v
5
), d(v
6
,v
6
), d(v
6
,v
7
), d(v
6
,v
8
), d(v
6
,v
9
), d(v
6
,v
10
)}= max
{2, 2, 1, 1, 1, 0, 1, 2, 1, 2} = 2
ecc(v
7
) = max {d(v
7
,v
1
), d(v
7
,v
2
), d(v
7
,v
3
), d(v
7
,v
4
), d(v
7
,v
5
), d(v
7
,v
6
), d(v
7
,v
7
), d(v
7
,v
8
), d(v
7
,v
9
), d(v
7
,v
10
)}= max
{3, 3, 2, 2, 1, 1, 0, 1, 1, 2} = 3
ecc(v
8
) = max {d(v
8
,v
1
), d(v
8
,v
2
), d(v
8
,v
3
), d(v
8
,v
4
), d(v
8
,v
5
), d(v
8
,v
6
), d(v
8
,v
7
), d(v
8
,v
8
), d(v
8
,v
9
), d(v
8
,v
10
)}= max
{4, 4, 3, 3, 2, 2, 1, 0, 1, 1} = 4
ecc(v
9
) = max {d(v
9
,v
1
), d(v
9
,v
2
), d(v
9
,v
3
), d(v
9
,v
4
), d(v
9
,v
5
), d(v
9
,v
6
), d(v
9
,v
7
), d(v
9
,v
8
), d(v
9
,v
9
), d(v
9
,v
10
)}= max
{3, 3, 2, 2, 2, 1, 1, 1, 0, 1} = 3
ecc(v
10
)= max{d(v
10
,v
1
), d(v
10
,v
2
), d(v
10
,v
3
), d(v
10
,v
4
), d(v
10
,v
5
), d(v
10
,v
6
), d(v
10
,v
7
), d(v
10
,v
8
), d(v
10
,v
9
),
d(v
10
,v
10
)}= max {4, 4, 3, 3, 3, 2, 2, 1, 1, 0} = 4
The radius of a graph G is the minimum of eccentricities of all its vertices and is denoted by rad(G). That is
rad(G) = min { ecc(v ) / v e V(G)}
rad(G) = min {ecc(v
1
), ecc(v
2
), ecc(v
3
), ecc(v
4
), ecc(v
5
), ecc(v
6
), ecc(v
7
), ecc(v
8
),
ecc(v
9
), ecc(v
10
)}
=min {4, 4, 3, 3, 3, 2, 3, 4, 3, 4} = 2
Rainbow connection number rc (G) = 5, rad (G) + 3 = 5
rc (G) = rad (G)+3
Theorem
Let
1 2
{ , ,....., }
n
I i i i = be an interval family and G is an interval graph with ( ) 2 G o > corresponding to

. I If i
and j are two intervals in I such that i 1, i is a dominated interval and j = 1, j is contained in i , if there are one or two
intervals intersecting to the right of the interval j, then the rainbow connection number, rc(G) = rad(G)+3.
Proof
Let
1 2
{ , ,....., }
n
I i i i = be an interval family and G is an interval graph with ( ) 2 G o > corresponding to

. I If i
and j are two intervals in I such that i 1, i is a dominated interval and j = 1, j is contained in i . Suppose assume that
there is no interval other than i that intersects to the right of j then we get a contradiction as the distance from the interval i
To Find the Comparison of the Radius with the Rainbow Connection Number of Interval Graphs 57
+3 to the interval j = 1 is large, then rad(G) +3 must be greater than the rainbow connection rc(G). Hence if j = 1, j is
contained in the dominated interval i then there must be one or two intervals excluding the dominated interval i. If j 1 and
j is contained in the dominated interval i, then it is enough only one interval k other than i to the right of j that intersects j.
Then we get rc(G) = rad(G)+3. This can be easily shown in the following illustration clearly. Consider the following
Interval family I,

Figure 4: Interval Family I
The corresponding neighborhoods of each vertex from the above interval family I are as follows,
nbd [ 1 ] = {1,2,3,4}, nbd [ 2 ] = {1,2,3,4}, nbd [ 3 ] ={1,2,3,4,5}, nbd [ 4 ] = {1,2,3,4,5},
nbd[ 5 ]={3,4,5,6,7}, nbd[6] = {5,6,7,8}, nbd[7]={5,6,7,8,9,10}, nbd[8]={6,7,8,9,10}, nbd[9]={7,8,9,10},
nbd[10]={7,8,9,10}.
In this regard the rainbow edge colors of G

are,
C(v
1
,v
2
) = 1, C(v
1
,v
3
) = 2, C(v
1
,v
4
) = 3, C(v
2
,v
3
) = 3, C(v
2
,v
4
) = 2, C(v
3
,v
4
) = 1, C(v
3
,v
5
) = 4, C(v
4
,v
5
) = 5, C(v
5
,v
6
)
= 1, C(v
5
,v
7
) = 2, C(v
6
,v
7
) = 3, C(v
6
,v
8
) = 2, C(v
7
,v
8
) = 1, C(v
7
,v
9
) = 4, C(v
7
,v
10
) = 5, C(v
8
,v
9
) = 3, C(v
8
,v
10
) = 4,
C(v
9
,v
10
) = 1.
Therefore the set of colors are, C = {1,2,3,3,2,1,4,5,1,2,3,2,1,4,5,3,4,1} = {1,2,3,4,5}
The Rainbow connection number rc(G) = 5.
The distances of the path lengths from the interval graph G are as follows,
Table 2
d(v
1
,v
1
)=0 d(v
2
,v
1
)=1 d(v
3
,v
1
)=1 d(v
4
,v
1
)=1 d(v
5
,v
1
)=2
d(v
1
,v
2
)=1 d(v
2
,v
2
)=0 d(v
3
,v
2
)=1 d(v
4
,v
2
)=1 d(v
5
,v
2
)=2
d(v
1
,v
3
)=1 d(v
2
,v
3
)=1 d(v
3
,v
3
)=0 d(v
4
,v
3
)=1 d(v
5
,v
3
)=1
d(v
1
,v
4
)= 1 d(v
2
,v
4
)=1 d(v
3
,v
4
)=1 d(v
4
,v
4
)=0 d(v
5
,v
4
)=1
d(v
1
,v
5
)= 2 d(v
2
,v
5
)=2 d(v
3
,v
5
)=1 d(v
4
,v
5
)=1 d(v
5
,v
5
)=0
d(v
1
,v
6
)= 3 d(v
2
,v
6
)=3 d(v
3
,v
6
)=2 d(v
4
,v
6
)=2 d(v
5
,v
6
)=1
d(v
1
,v
7
)= 3 d(v
2
,v
7
)=3 d(v
3
,v
7
)=2 d(v
4
,v
7
)=1 d(v
5
,v
7
)=1
d(v
1
,v
8
)= 4 d(v
2
,v
8
)=4 d(v
3
,v
8
)=3 d(v
4
,v
8
)=3 d(v
5
,v
8
)=2
d(v
1
,v
9
)= 4 d(v
2
,v
9
)=4 d(v
3
,v
9
)=3 d(v
4
,v
9
)=3 d(v
5
,v
9
)=2
d(v
1
,v
10
)=4 d(v
2
,v
10
)=4 d(v
3
,v
10
)= 3 d(v
4
,v
10
)= 3 d(v
5
,v
10
) =2
d(v
6
,v
1
)= 3 d(v
7
,v
1
)=3 d(v
8
,v
1
)=4 d(v
9
,v
1
)=4 d(v
10
,v
1
)=4
d(v
6
,v
2
)= 3 d(v
7
,v
2
)=3 d(v
8
,v
2
)=4 d(v
9
,v
2
)=4 d(v
10
,v
2
)=4
d(v
6
,v
3
)= 2 d(v
7
,v
3
)=2 d(v
8
,v
3
)=3 d(v
9
,v
3
)=3 d(v
10
,v
3
)=3
d(v
6
,v
4
)= 2 d(v
7
,v
4
)=1 d(v
8
,v
4
)=3 d(v
9
,v
4
)=3 d(v
10
,v
4
)=3
d(v
6
,v
5
)= 1 d(v
7
,v
5
)=1 d(v
8
,v
5
)=2 d(v
9
,v
5
)=2 d(v
10
,v
5
)=2
d(v
6
,v
6
)= 0 d(v
7
,v
6
)=1 d(v
8
,v
6
)=1 d(v
9
,v
6
)=2 d(v
10
,v
6
)=2
d(v
6
,v
7
)= 1 d(v
7
,v
7
)=0 d(v
8
,v
7
)=1 d(v
9
,v
7
)=1 d(v
10
,v
7
)=1
d(v
6
,v
8
)= 1 d(v
7
,v
8
)=1 d(v
8
,v
8
)=0 d(v
9
,v
8
)=1 d(v
10
,v
8
)=1
d(v
6
,v
9
)= 2 d(v
7
,v
9
)=1 d(v
8
,v
9
)=1 d(v
9
,v
9
)=0 d(v
10
,v
9
)=1

The eccentricities of the vertices is as follows,
( )
( ) max ( , )
x V G
ecc v d v x
e
=

1
4
7 10
2
6
8
3
5
9
58 A. Sudhakaraiah, E. Gnana Deepika, V. Rama Latha & T. Venkataeswarlu
ecc(v
1
) = max {d(v
1
,v
1
), d(v
1
,v
2
), d(v
1
,v
3
), d(v
1
,v
4
), d(v
1
,v
5
),d(v
1
,v
6
),d(v
1
,v
7
),d(v
1
,v
8
), d(v
1
,v
9
), d(v
1
,v
10
)}= max
{0,1,1,1,2,3,3,4,4,4} = 4
ecc(v
2
) = max {d(v
2
,v
1
), d(v
2
,v
2
), d(v
2
,v
3
), d(v
2
,v
4
), d(v
2
,v
5
), d(v
2
,v
6
), d(v
2
,v
7
), d(v
2
,v
8
), d(v
2
,v
9
), d(v
2
,v
10
)} = max
{1,0,1,1,2,3,3,4,4,4} = 4
ecc(v
3
) = max {d(v
3
,v
1
), d(v
3
,v
2
), d(v
3
,v
3
), d(v
3
,v
4
), d(v
3
,v
5
), d(v
3
,v
6
), d(v
3
,v
7
), d(v
3
,v
8
), d(v
3
,v
9
), d(v
3
,v
10
)} = max
{1,1,0,1,1,2,2,3,3,3} = 3
ecc(v
4
) = max {d(v
4
,v
1
), d(v
4
,v
2
), d(v
4
,v
3
), d(v
4
,v
4
), d(v
4
,v
5
), d(v
4
,v
6
), d(v
4
,v
7
), d(v
4
,v
8
), d(v
4
,v
9
), d(v
4
,v
10
)} = max
{1,1,1,0,1,2,1,3,3,3} = 3
ecc(v
5
) = max {d(v
5
,v
1
), d(v
5
,v
2
), d(v
5
,v
3
), d(v
5
,v
4
), d(v
5
,v
5
), d(v
5
,v
6
), d(v
5
,v
7
), d(v
5
,v
8
), d(v
5
,v
9
), d(v
5
,v
10
)}= max
{2,2,1,1,0,1,1,2,2,2} = 2
ecc(v
6
) = max {d(v
6
,v
1
), d(v
6
,v
2
), d(v
6
,v
3
), d(v
6
,v
4
), d(v
6
,v
5
), d(v
6
,v
6
), d(v
6
,v
7
), d(v
6
,v
8
), d(v
6
,v
9
), d(v
6
,v
10
)}= max
{3,3,2,2,1,0,1,1,2,2} = 3
ecc(v
7
) = max {d(v
7
,v
1
), d(v
7
,v
2
), d(v
7
,v
3
), d(v
7
,v
4
), d(v
7
,v
5
), d(v
7
,v
6
), d(v
7
,v
7
), d(v
7
,v
8
), d(v
7
,v
9
), d(v
7
,v
10
)} = max
{3,3,2,1,1,1,0,1,1,1} = 3
ecc(v
8
) = max {d(v
8
,v
1
), d(v
8
,v
2
), d(v
8
,v
3
), d(v
8
,v
4
), d(v
8
,v
5
), d(v
8
,v
6
), d(v
8
,v
7
), d(v
8
,v
8
), d(v
8
,v
9
), d(v
8
,v
10
)} = max
{4,4,3,3,2,1,1,0,1,1} = 4
ecc(v
9
) = max {d(v
9
,v
1
), d(v
9
,v
2
), d(v
9
,v
3
), d(v
9
,v
4
), d(v
9
,v
5
), d(v
9
,v
6
), d(v
9
,v
7
), d(v
9
,v
8
), d(v
9
,v
9
), d(v
9
,v
10
)}= max
{4,4,3,3,2,2,1,1,0,1} = 4
ecc(v
10
)= max{d(v
10
,v
1
), d(v
10
,v
2
), d(v
10
,v
3
), d(v
10
,v
4
), d(v
10
,v
5
), d(v
10
,v
6
), d(v
10
,v
7
), d(v
10
,v
8
), d(v
10
,v
9
),
d(v
10
,v
10
)}= max {4,4,3,3,2,2,1,1,1,0} = 4
The radius of a graph G is the minimum of eccentricities of all its vertices and is denoted by rad(G). That is
rad(G) = min { ecc(v ) / v e V(G)}
rad(G) = min {ecc(v
1
), ecc(v
2
), ecc(v
3
), ecc(v
4
), ecc(v
5
), ecc(v
6
), ecc(v
7
), ecc(v
8
), ecc(v
9
), ecc(v
10
)} = min { 4,
4, 3, 3, 2, 3, 3, 4, 4, 4 } = 2
Rainbow connection number rc(G) = 5, rad(G) + 3 = 5
rc (G) = rad (G)+3If there is no interval other than i that intersects to the right of j = 1, then the corresponding
interval family I is as follows,

Figure 5: Interval Family I
Clearly we can see that rc(G) < rad(G)+3. Hence our assumption that, there is no interval other than i that
intersects to the right of j = 1 is wrong. So, if i and j are any two intervals in I such that i 1, i is a dominated interval
and j = 1, j is contained in i , if there are one or two intervals intersecting to the right of the interval j, then the rainbow
connection number, rc(G) = rad(G)+3.
1 4
7 10
2
6
8
3
5
9
To Find the Comparison of the Radius with the Rainbow Connection Number of Interval Graphs 59
Theorem
Let
1 2
{ , ,....., }
n
I i i i = be an interval family and G is an interval graph with ( ) 2 G o > corresponding to . I If
k j i , , are three consecutive intervals such that k j i < < and j is a dominated interval, i intersects j , j intersect k
and i intersect k and if j is the last dominated interval, then i must intersects k+1, then the rainbow connection number,
rc(G) = rad(G)+3.
Proof
Let
1 2
{ , ,....., }
n
I i i i = be an interval family and G is an interval graph with ( ) 2 G o > corresponding to . I
If k j i , , are three consecutive intervals such that k j i < < and j is a dominated interval, i intersects j , j intersect
k and i intersect k , to prove the equality rc(G) = rad(G)+3, it is necessary that the last dominated interval i.e., if j is the
last dominated interval, then i must intersects the interval k+1.
As a contradiction, let us assume that, if j is the last dominated interval and the interval i does not intersects the
interval k+1. Then the rainbow connection number will be decreases and the minimum value of eccentricities of all
vertices will be increases. Thus we get the inequality as rc(G) < rad(G)+3, which is a contradiction to the equality rc(G) =
rad(G)+3. This can be proved with the following illustration.Consider the following interval family I as follows,
.
Figure 6: Interval Family I
In this interval family we can easily seen that rc(G) = 4 and rad(G) = 3, it leads to a contradiction that rc(G) <
rad(G)+3. Hence our assumption that, if j is the last dominated interval and the interval i does not intersects the interval
k+1 is wrong. If i, j, k are three consecutive intervals such that i<j<k and j is the dominated interval, i intersects j, j
intersects k and i intersects k and if j is the last dominated interval then i must intersects k+1 then the rainbow connection
number, rc(G) = rad(G)+3. For this consider the following interval family,

Figure 7: Interval Family I
The corresponding neighborhoods of each vertex from the above interval family I are as follows,
nbd [ 1 ] = {1,2,3}, nbd [ 2 ] = {1,2,3,4}, nbd [ 3 ] = {1,2,3,4,5}, nbd [ 4 ] = { 2,3,4,5,6},
nbd [ 5 ] = {3,4,5,6,7}, nbd [ 6 ] = {4,5,6,7,8}, nbd [ 7 ] = {5,6,7,8,9,10},
nbd [ 8 ] = {6,7,8,9,10}, nbd [ 9 ] = { 7,8,9,10}, nbd [ 10 ] = {7,8,9,10}
The rainbow edge colors as follows from the interval graph G corresponding to the interval family I,
C(v
1
,v
2
) = 1, C(v
1
,v
3
) = 2, C(v
2
,v
3
) = 3, C(v
2
,v
4
) = 2, C(v
3
,v
4
) = 1, C(v
3
,v
5
) = 4,
1 4
7
10
2
6
8
3
5
9
1 4
7
10
2
6
8
3
5
9
60 A. Sudhakaraiah, E. Gnana Deepika, V. Rama Latha & T. Venkataeswarlu
C(v
4
,v
5
) = 3, C(v
4
,v
6
) = 4, C(v
5
,v
6
) = 1, C(v
5
,v
7
) = 2, C(v
6
,v
7
) = 3, C(v
6
,v
8
) = 2, C(v
7
,v
8
) = 1,
C(v
7
,v
9
) = 4, C(v
7
,v
10
) = 5, C(v
8
,v
9
) = 3, C(v
8
,v
10
) = 4, C(v
9
,v
10
) = 1
Therefore the set of colors are, C = {1,2,3,2,1,4,3,4,1,2,3,2,1,4,5,3,4,1} = {1,2,3,4,5}
The Rainbow connection number rc(G) = 5.
The distances of the path lengths from the interval graph G are as follows,
Table 3
d(v
1
,v
1
)=0 d(v
2
,v
1
)=1 d(v
3
,v
1
)=1 d(v
4
,v
1
)=1 d(v
5
,v
1
)=2
d(v
1
,v
2
)=1 d(v
2
,v
2
)=0 d(v
3
,v
2
)=1 d(v
4
,v
2
)=1 d(v
5
,v
2
)=2
d(v
1
,v
3
)=1 d(v
2
,v
3
)=1 d(v
3
,v
3
)=0 d(v
4
,v
3
)=1 d(v
5
,v
3
)=1
d(v
1
,v
4
)= 2 d(v
2
,v
4
)=1 d(v
3
,v
4
)=1 d(v
4
,v
4
)=0 d(v
5
,v
4
)=1
d(v
1
,v
5
)= 2 d(v
2
,v
5
)=2 d(v
3
,v
5
)=1 d(v
4
,v
5
)=1 d(v
5
,v
5
)=0
d(v
1
,v
6
)= 3 d(v
2
,v
6
)=2 d(v
3
,v
6
)=2 d(v
4
,v
6
)=1 d(v
5
,v
6
)=1
d(v
1
,v
7
)= 3 d(v
2
,v
7
)=3 d(v
3
,v
7
)=2 d(v
4
,v
7
)=2 d(v
5
,v
7
)=1
d(v
1
,v
8
)= 4 d(v
2
,v
8
)=3 d(v
3
,v
8
)=3 d(v
4
,v
8
)=2 d(v
5
,v
8
)=2
d(v
1
,v
9
)= 4 d(v
2
,v
9
)=4 d(v
3
,v
9
)=3 d(v
4
,v
9
)=3 d(v
5
,v
9
)=2
d(v
1
,v
10
)=4 d(v
2
,v
10
)=4 d(v
3
,v
10
)= 3 d(v
4
,v
10
)= 3 d(v
5
,v
10
) =2
d(v
6
,v
1
)= 3 d(v
7
,v
1
)=3 d(v
8
,v
1
)=4 d(v
9
,v
1
)=4 d(v
10
,v
1
)=4
d(v
6
,v
2
)= 2 d(v
7
,v
2
)=3 d(v
8
,v
2
)=3 d(v
9
,v
2
)=4 d(v
10
,v
2
)=4
d(v
6
,v
3
)= 2 d(v
7
,v
3
)=2 d(v
8
,v
3
)=3 d(v
9
,v
3
)=3 d(v
10
,v
3
)=3
d(v
6
,v
4
)= 1 d(v
7
,v
4
)=2 d(v
8
,v
4
)=2 d(v
9
,v
4
)=3 d(v
10
,v
4
)=3
d(v
6
,v
5
)= 1 d(v
7
,v
5
)=1 d(v
8
,v
5
)=2 d(v
9
,v
5
)=2 d(v
10
,v
5
)=2
d(v
6
,v
6
)= 0 d(v
7
,v
6
)=1 d(v
8
,v
6
)=1 d(v
9
,v
6
)=2 d(v
10
,v
6
)=2
d(v
6
,v
7
)= 1 d(v
7
,v
7
)=0 d(v
8
,v
7
)=1 d(v
9
,v
7
)=1 d(v
10
,v
7
)=1
d(v
6
,v
8
)= 1 d(v
7
,v
8
)=1 d(v
8
,v
8
)=0 d(v
9
,v
8
)=1 d(v
10
,v
8
)=1

The eccentricities of the vertices is as follows,
( )
( ) max ( , )
x V G
ecc v d v x
e
=

ecc(v
1
) = max {d(v
1
,v
1
), d(v
1
,v
2
), d(v
1
,v
3
), d(v
1
,v
4
), d(v
1
,v
5
), d(v
1
,v
6
), d(v
1
,v
7
), d(v
1
,v
8
), d(v
1
,v
9
), d(v
1
,v
10
)}= max
{0, 1, 1, 2, 2, 3, 3, 4, 4, 4} = 4
ecc(v
2
) = max {d(v
2
,v
1
), d(v
2
,v
2
), d(v
2
,v
3
), d(v
2
,v
4
), d(v
2
,v
5
), d(v
2
,v
6
), d(v
2
,v
7
), d(v
2
,v
8
), d(v
2
,v
9
), d(v
2
,v
10
)}= max
{1, 0, 1, 1, 2,2,3, 3, 4,4} = 4
ecc(v
3
) = max {d(v
3
,v
1
), d(v
3
,v
2
), d(v
3
,v
3
), d(v
3
,v
4
), d(v
3
,v
5
), d(v
3
,v
6
), d(v
3
,v
7
), d(v
3
,v
8
), d(v
3
,v
9
),d(v
3
,v
10
)} = max
{1, 1, 0, 1, 1, 2, 2, 3, 3,3} = 3
ecc(v
4
) = max {d(v
4
,v
1
), d(v
4
,v
2
), d(v
4
,v
3
), d(v
4
,v
4
), d(v
4
,v
5
), d(v
4
,v
6
), d(v
4
,v
7
), d(v
4
,v
8
), d(v
4
,v
9
), d(v
4
,v
10
)}= max
{1, 1, 1, 0, 1,1, 2,2, 3,3} = 3
ecc(v
5
) = max {d(v
5
,v
1
), d(v
5
,v
2
), d(v
5
,v
3
), d(v
5
,v
4
), d(v
5
,v
5
), d(v
5
,v
6
), d(v
5
,v
7
), d(v
5
,v
8
), d(v
5
,v
9
), d(v
5
,v
10
)}= max
{2, 2, 1, 1, 0, 1, 1, 2, 2,2} = 2
ecc(v
6
) = max {d(v
6
,v
1
), d(v
6
,v
2
), d(v
6
,v
3
), d(v
6
,v
4
), d(v
6
,v
5
), d(v
6
,v
6
), d(v
6
,v
7
), d(v
6
,v
8
), d(v
6
,v
9
), d(v
6
,v
10
)}= max
{3, 2, 2, 1,1, 0, 1, 1, 2,2} = 3
ecc(v
7
) = max {d(v
7
,v
1
), d(v
7
,v
2
), d(v
7
,v
3
), d(v
7
,v
4
), d(v
7
,v
5
), d(v
7
,v
6
), d(v
7
,v
7
), d(v
7
,v
8
), d(v
7
,v
9
), d(v
7
,v
10
)}= max
{3,3, 2, 2, 1, 1, 0, 1, 1,1} = 3
ecc(v
8
) = max {d(v
8
,v
1
), d(v
8
,v
2
), d(v
8
,v
3
), d(v
8
,v
4
), d(v
8
,v
5
), d(v
8
,v
6
), d(v
8
,v
7
), d(v
8
,v
8
), d(v
8
,v
9
),d(v
8
,v
10
)}= max
{4, 3, 3, 2, 2, 1,1, 0, 1, 1}= 4
To Find the Comparison of the Radius with the Rainbow Connection Number of Interval Graphs 61
ecc(v
9
) = max {d(v
9
,v
1
), d(v
9
,v
2
), d(v
9
,v
3
), d(v
9
,v
4
), d(v
9
,v
5
), d(v
9
,v
6
), d(v
9
,v
7
), d(v
9
,v
8
), d(v
9
,v
9
), d(v
9
,v
10
)}= max
{4,4,3, 3, 2, 2, 1, 1, 0,1} = 4
ecc(v
10
) = max {d(v
10
,v
1
), d(v
10
,v
2
), d(v
10
,v
3
), d(v
10
,v
4
), d(v
10
,v
5
), d(v
10
,v
6
), d(v
10
,v
7
), d(v
10
,v
8
), d(v
10
,v
9
),
d(v
10
,v
10
)} = max {4,4, 3, 3, 2, 2, 1, 1, 1,0} = 4
The radius of a graph G is the minimum of eccentricities of all its vertices and is denoted by rad (G).
That is rad(G) = min { ecc(v ) / v e V(G)}
rad(G) = min {ecc(v
1
), ecc(v
2
), ecc(v
3
), ecc(v
4
), ecc(v
5
), ecc(v
6
), ecc(v
7
),
ecc(v
8
), ecc(v
9
), ecc(v
10
)}
= min {4, 4, 3, 3, 2, 3, 3, 4, 4, 4} = 2
Rainbow connection number rc(G) = 5, rad(G) + 3 = 5
rc (G) = rad (G)+3
REFERENCES
1. Y. Caro, A. Lev, Y. Roditty, Z. Tuza, and R. Yuster, On rainbow connection, Electr J Combin 15(R57) (2008), 1.
2. G. Chartrand, G.L. Johns, K.A. McKeon, and P. Zhang, Rainbow connection in graphs, Math Bohemica 133(1)
(2008), 5-98.
3. P. Erdos, J. Pach, R. Pollack, and Z. Tuza, Radius, diameter and minimum degree, J Combin Theory, Ser B 47(1)
(1989), 73-79.
4. Schiermeyer, Rainbow connection in graphs with minimum degree three, in: Combinatorial Algorithms, Lecture
Notes in Computer Science 5874 (J. Fiala, J. Kratochvl, and M. Miller, Eds.), Springer Berlin/ Heidelberg, 2009,
pp. 432-437.
5. S. Chakraborty, E. Fischer, A. Matsliah, and R. Yuster, Hardness and algorithms for rainbow connection, J
Combin Optimiz (2009), 1-18.