See discussions, stats, and author profiles for this publication at: https://www.researchgate.
net/publication/331935463
Rainbow Connection Number of H-Graph
Article · March 2019
CITATIONS READS
3 315
2 authors:
Dharamvirsinh Parmar Bharat Suthar
C.U.Shah University C. U. Shah Univeristy
34 PUBLICATIONS 51 CITATIONS 6 PUBLICATIONS 4 CITATIONS
SEE PROFILE SEE PROFILE
Some of the authors of this publication are also working on these related projects:
Graph Theory View project
All content following this page was uploaded by Dharamvirsinh Parmar on 01 March 2020.
The user has requested enhancement of the downloaded file.
JASC: Journal of Applied Science and Computations ISSN NO: 1076-5131
Rainbow Connection Number of H- Graph
Dharamvirsinh Parmar#1, Mr. Bharat Suthar*2
#
Assistant Professor in Mathematics, Department of Mathematics, C.U.Shah University, Wadhwan, India
*
Research Scholar of Mathematics, C.U.Shah University, Wadhwan, India
[email protected] [email protected]
Abstract— A rainbow coloring of connected graph is a coloring the edges of graph, such that every pair of vertices is connected
by at least one path in which no two edges are colored the same. In this paper, we investigate the rainbow vertex connection number
and rainbow connection number for class of H - graph
Keywords— Rainbow vertex coloring, Rainbow coloring, H – graph
I. INTRODUCTION
We consider finite, connected and undirected graph. We consider graph = ( ( ), ( )) having set of vertices
( ) and set of edges ( ) respectively. We refer Gross and Yellen [4] for all kind of definitions and notations.
Definition 1.1 In connected graph , the distance between two of it’s vertices and is the length of the shortest path
between them. It is denoted by , .
Definition 1.2 In a graph , eccentricity of a vertex ∈ ( ), denoted by ( ) is the distance from to the vertex farthest
from in . i.e. ( ) = ∈ ( , ).
Definition 1.3 In a graph , vertex ∈ ( ) is called center of if ( ) is minimum.
Definition 1.4 The diameter of a graph is denoted by ( ), defined as ∈ ( ).
Definition 1.5 A path in edge colored graph with no two edges having the same color is called rainbow path.
Definition 1.6 An edge colored graph is called rainbow connected if any two vertices are connected by rainbow path.
The rainbow connection number of a graph, denoted by ( ) is the smallest number of colors that are needed in order
to make graph rainbow connected. It is easy to see that for any connected graph ( )≤ ( ).
Definition 1.7 A path in vertex colored graph with no two internal vertices having the same color is called rainbow vertex
path.
Definition 1.8 An vertex colored graph is called rainbow connected if any two vertices are connected by rainbow vertex path.
Definition 1.9 The H – graph of a path is the graph obtained from two copies of with vertices , ,…., and
, ,…., by joining the vertices and by an edge if is odd and the vertices and if is even.
Definition 1.10 Corona of graph with having and vertices respectively, is a graph obtained by taking one copy of
and copies of and joining vertex of with an edge to every vertex in the copy of . It is denoted by ⊙ .
The rainbow connection number was introduced by Chartrand, Johns, McKeon, and Zhang in [3]. It has applications
in transferring information of high security in multicomputer networks. We refer the reader to [8] for details. The rainbow
vertex connection number of a graph, denoted by ( ) is the smallest number of colors that are needed in order to make
graph rainbow vertex connected. M. Krivelevich and R. Yuster in [6] gave the lower bound for ( ), ( ) −1≤
( ).
Volume VI, Issue III, March/2019 Page No:1487
JASC: Journal of Applied Science and Computations ISSN NO: 1076-5131
Li. Hengzhe and Ma. Yingbin [5] discussed about rainbow connection number and graph operation. Also Annammal and
Mercy [1] derives rainbow connection number of shadow graphs. Dian N.S. Simamora and A.N.M.Salman [2] discussed about
the rainbow (Vertex) coloring of Pencil graph. In this paper we focus on rainbow vertex connection number and rainbow
connection number of H – graph.
II. MAIN RESULT
Theorem 2.1 Rainbow connection number of H –graph of a path is 2 − 1.
Proof: Let be the path , ,…., . We can obtain H – graph by considering two copis of path . Hence we have
{ , : 1 ≤ ≤ } be the set of vertices be the set of edges of H – graph. | | = 2 and | | = 2 − 1.
Edge coloring algorithm: If is odd or even.
Edge Condition Color
( , ) 1 ≤ ≤ −1
( , ) 1≤ ≤ −1
1< <
, is odd
, is even
We have used total 2 − 1 color. Consider any path in H – graph. We obtain following cases
Case Vertex Vertex Condition Rainbow path
1 1 ≤ < ≤ , ,…,
2 1 ≤ < ≤ , ,…,
3 1 ≤ < ≤ , ,…,
4 1 ≤ < ≤ , ,…,
1 ≤ ≤ , ≤ ≤ , ,…, , , ,…,
5 ( is Odd)
1 ≤ ≤ , +1≤ ≤ , ,…, , , ,…,
( is Even)
≤ ≤ ,1 ≤ ≤ , ,…, , , ,…,
( is Odd)
6
≤ ≤ , 1 ≤ ≤ +1 , ,…, , , ,…,
( is Even)
1 ≤ , ≤ ( is Odd) , ,…, , , ,…,
7 1 ≤ ≤ ,1 ≤ ≤ + 1 ( is , ,…, , , ,…,
Even)
8 < , ≤ ( is Odd) , ,…, , , ,…,
Volume VI, Issue III, March/2019 Page No:1488
JASC: Journal of Applied Science and Computations ISSN NO: 1076-5131
< ≤ , +1 < ≤ ( is , ,…, , , ,…,
Even)
Thus, if we consider any path connecting the vertices there exists at least one path in H - graph that form rainbow path. Hence
rainbow connection number of H- graph is 2 − 1.
Illustration 2.2 In figure – 1 shows that Rainbow connection number of H –graph of a path is 9
Theorem 2.3 Rainbow vertex connection number of H –graph of a path is 2 − 4.
Proof: Let be the path , ,…., . We can obtain H – graph by considering two copis of path . Hence we have
{ , : 1 ≤ ≤ } be the set of vertices of H – graph. | | = 2 and | | = 2 − 1.
Vertex coloring algorithm: n- odd or even
Vertex Condition Color
= 1and =
1< <
= 1and =
1< <
We have used total 2 − 4 color. Consider any path in H – graph. We obtain following cases
Case Vertex Vertex Condition Rainbow path
1 1 ≤ < ≤ , ,…,
2 1 ≤ < ≤ , ,…,
3 1 ≤ < ≤ , ,…,
4 1 ≤ < ≤ , ,…,
1 ≤ ≤ , ≤ ≤ , ,…, , , ,…,
5 ( is Odd)
1 ≤ ≤ , +1≤ ≤ , ,…, , , ,…,
( is Even)
≤ ≤ ,1 ≤ ≤ , ,…, , , ,…,
( is Odd)
6
≤ ≤ , 1 ≤ ≤ +1 , ,…, , , ,…,
( is Even)
1 ≤ , ≤ ( is Odd) , ,…, , , ,…,
7 1 ≤ ≤ ,1 ≤ ≤ + 1 ( is , ,…, , , ,…,
Even)
< , ≤ ( is Odd) , ,…, , , ,…,
8 < ≤ , +1 < ≤ ( is , ,…, , , ,…,
Even)
Volume VI, Issue III, March/2019 Page No:1489
JASC: Journal of Applied Science and Computations ISSN NO: 1076-5131
Thus, if we consider any path connecting the vertices there exists at least one path in H - graph that form rainbow vertex path.
Hence rainbow vertex connection number of H- graph is 2 − 1.
Illustration 2.4 In figure – 2 shows that Rainbow vertex connection number of H –graph of a path is 8.
Theorem 2.5 Rainbow vertex connection number of H⨀ of a path is 2 .
Proof: Let be the path , ,…., . We can obtain H – graph by considering two copies of path . To generate corona
graph with consider 2 copies of . Hence we have { , :1 ≤ ≤ } ∪ :1 ≤ ≤ ,1 ≤ ≤ ∪ :1 ≤
≤ ,1 ≤ ≤ be the set of vertices of H⨀ graph. | | = 2 ( + 1) and | | = 2 ( + 1) − 1.
Vertex coloring algorithm: , − odd or even
Vertex Condition Color
1≤ ≤
1≤ ≤
1 ≤ ≤ ,1 ≤ ≤
1 ≤ ≤ ,1 ≤ ≤
We have used total 2 color. Consider any path in H – graph. We obtain following cases
Case Vertex Vertex Condition Rainbow path
1 1 ≤ < ≤ , ,…,
2 1 ≤ < ≤ , ,…,
3 1 ≤ < ≤ , ,…,
4 1 ≤ < ≤ , ,…,
1 ≤ ≤ , ≤ ≤ , ,…, , , ,…,
5 ( is Odd)
1 ≤ ≤ , +1≤ ≤ , ,…, , , ,…,
( is Even)
≤ ≤ ,1 ≤ ≤ , ,…, , , ,…,
( is Odd)
6
≤ ≤ , 1 ≤ ≤ +1 , ,…, , , ,…,
( is Even)
1 ≤ , ≤ ( is Odd) , ,…, , , ,…,
7 1 ≤ ≤ ,1 ≤ ≤ + 1 ( is , ,…, , , ,…,
Even)
< , ≤ ( is Odd) , ,…, , , ,…,
8 < ≤ , +1 < ≤ ( is , ,…, , , ,…,
Even)
9 1≤ , ≤ ,1 ≤ , ≤ , , ,..., , ,
10 1≤ , ≤ ,1 ≤ , ≤ , , ,..., , ,
Volume VI, Issue III, March/2019 Page No:1490
JASC: Journal of Applied Science and Computations ISSN NO: 1076-5131
1 ≤ ≤ , ≤ ≤ , , ,… , , , …,
( is Odd) 1 ≤ , ≤ , , ,
11
1 ≤ ≤ , +1≤ ≤ , , ,…, , , ,…,
( is Even) 1 ≤ , ≤ ,
≤ ≤ ,1 ≤ ≤ , , ,…, , , , …,
( is Odd) 1 ≤ , ≤ , , ,
12
≤ ≤ , 1 ≤ ≤ +1 , , ,…, , , , …,
( is Even) 1 ≤ , ≤ , , ,
1 ≤ , ≤ ( is Odd) 1 ≤ , , ,…, , , , …,
, ≤ , ,
13
1 ≤ ≤ ,1 ≤ ≤ + 1 ( is , , ,…, , , , …,
Even) 1 ≤ , ≤ , ,
< , ≤ ( is Odd) 1 ≤ , , ,…, , , , …,
, ≤ , , ,
14
< ≤ , +1 < ≤ ( is , , ,…, , , , …,
Even) 1 ≤ , ≤ , ,
Thus, if we consider any path connecting the vertices there exists at least one path in H⨀ graph that form rainbow vertex
path. Hence rainbow vertex connection number of H⨀ graph is 2 .
Illustration 2.6 In figure – 3 shows that Rainbow vertex connection number of H ⨀ graph of a path is 14.
Volume VI, Issue III, March/2019 Page No:1491
JASC: Journal of Applied Science and Computations ISSN NO: 1076-5131
III. CONCLUSION
The rainbow vertex coloring and rainbow coloring of −graph and rainbow vertex coloring of corona graph H⨀ has
been defined and using it we have computed their rainbow connection and rainbow vertex connection number.
REFERENCES
[1] A. Annammal and M.Mercy, “Rainbow Coloring of Shadow Graph”, International Journal of Pure and Applied
Mathematics, vol 101 No.6 ,pp 873-881,2015.
[2] Dian N.S. Simamora and A.N.M.Salman, “The Rainbow (Vertex) connection number of Pencil Graphs”, Procedia
Computer Science 74 (2015) 138 – 142.Doi: 10.1016/j.procs.2015.12.089
[3] G.Chartrand, G.L.Johns, K.A.McKeon and P.Zhang, “Rainbow connection in graphs”, Math. Bohem. 133(2008), pp85–
98.
[4] J.Gross and J.Yellen, “Graph Theory and its applications”, CRC Press
[5] Li. Hengzhe, Ma. Yingbin, “Rainbow connection number and graph operations”, Discrete Applied Mathematics,2017.
[6] M Krivelevich and R Yuster, “Rainbow connection of a graph is reciprocal to its minimum degree three”, J.Graph Theory
2009; 63(3): 185 – 191.
[7] N.Parmar and D. Parmar, “Product Cordial Labelling in Context of some Graph Operations on Cycle”, Mathematics
Today, Vol. 34(A) pp.218-227,2018.
[8] S.Chakraborty, E.Fischer, A.Matsliah and R.Yuster, “Hardness and algorithms for rainbow connectivity”,
J.Comb.Optim.21(2011) pp 330–347.
[9] X.Li and Y.Sun, “Rainbow Connections of Graphs”, Springer Briefs in Math., Springer, New York, 2012.
Volume VI, Issue III, March/2019 Page No:1492
View publication stats
