Journal of Physics: Conference Series

PAPER • OPEN ACCESS Related content

- On the total rainbow connection of the
On rainbow connection and strong rainbow wheel related graphs
M. S. Hasan, Slamin, Dafik et al.
connection number of amalgamation of prism - On Rainbow k-Connection Number of
Special Graphs and It’s Sharp Lower
graph P3,2 Bound
Ika Hesti Agustin, Dafik, A.W. Gembong et
al.

To cite this article: C.D.R. Palupi et al 2018 J. Phys.: Conf. Ser. 1008 012052 - PICKERING-RACINE PRISMS
REVISITED.
C. A. Christian and R. Racine

View the article online for updates and enhancements.

This content was downloaded from IP address 182.0.238.144 on 13/07/2019 at 10:39

ICCGANT IOP Publishing
IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018)
1234567890 ‘’“” 012052 doi:10.1088/1742-6596/1008/1/012052

On rainbow connection and strong rainbow

connection number of amalgamation of prism graph
P3,2
C.D.R. Palupi1 , W. Aribowo2 , Y. Irene3, , I. Hasanah4,
1,2,3
Department of Mathematics, Faculty of Science and Technology, UIN Syarif Hidayatullah,
Jakarta
4
UIN Sultan Maulana Hasanuddin, Banten
E-mail: cynthia.dhevy13@mhs.uinjkt.ac.id

Abstract. Let G be a nontrivial connected graph. We follow Chartrand, et al in [2] for the

definiton of rainbow connection and strong rainbow connection number. For t ∈ N and t ≥ 2,
let P(3,2)i |i ∈ {1, 2, . . . , t} is a finite collection of prism graph P3,2 that has a fixed vertex v
called a terminal. The amalgamation of prism graph, Amal(P(3,2)i , v), is a graph formed by
taking all the element of finite collection of prism graph P3,2 and identifying their terminal.
This paper determines the rainbow connection and strong rainbow connection number from
amalgamation of prism graph by a deductive reasoning method. The result are as follows:
rc(Amal(P(3,2)i , v)) = 4 and src(Amal(P(3,2)i , v)) = max {4, t} for i ∈ {1, 2, . . . , t}.

1. Introduction
Let G be a nontrivial connected graph. We follow Chartrand, et al in [2] for the definition
of rainbow connection and strong rainbow connection number. The following definition of an
amalgamation of graphs is taken from [5]. For t ∈ N and i ∈ {1, 2, . . . , t} , let Gi be a simple
connected graph and |V (Gi )| = ki ≥ 2 for some ki ∈ N . For t ≥ 2, let {G1 , G2 , . . . , Gt } be a
finite collection of graphs and each Gi , i ∈ {1, 2, . . . , t}, has a fixed vertex v called a terminal.
The amalgamation Amal(Gi , v) is a graph formed by taking all the Gi s and identifying their
∼
 Let G = Amal(Gi , v). We define V (G) = {v} ∪ {vi,j |1 ≤ i ≤ t, 1 ≤ j ≤ ki − 1}.
terminals.
Let P(3,2)i , i ∈ {1, 2, . . . , t} be a finite set of prism graph, with P(3,2)1 , P(3,2)2 , . . . , P(3,2)t
as its element. Also, let P(3,2)i be the i-th prism graph component, with
V (P3,2 ) = {va,b ; 1 ≤ a ≤ 3, 1 ≤ b ≤ 2} and E(P3,2 ) = {va,b va+1,b ; 1 ≤ a ≤ 2, 1 ≤ b ≤ 2} ∪
{v3,b v1,b ; 1 ≤ b ≤ 2} ∪ {va,1 va,2 ; 1 ≤ a ≤ 3}. The component graph willhave |V (P3,2 )| = 6 and
|E(P3,2 )| = 9. An amalgamation from finite collection of prism graph P(3,2)i and has a fixed
vertex v called terminal, denoted by Amal(P(3,2)i , v). Let G ∼ = Amal(P(3,2)i , v). Graph G have
V (G) = {v} ∪ {vi,j |1 ≤ i ≤ t, 1 ≤ j ≤ 5} and E(G) = {vi,k vi,k+1 |1 ≤ i ≤ t, 1 ≤ k ≤ 4} ∪ {vvi,1 } ∪
{vvi,2 } ∪ {vvi,5 } ∪ {vi,1 vi,4 } ∪ {vi,3 vi,5 } with |E(G)| = 9t and |V (G)| = 5t + 1. See Figure 1 for
the illustration.
Chartrand, et al in [2] found out that if G is a nontrivial connected graph with size m which
the diameter of G denoted by diam(G), then:
diam(G) ≤ rc(G) ≤ src(G) ≤ m (1)

Content from this work may be used under the terms of the Creative Commons Attribution 3.0 licence. Any further distribution
of this work must maintain attribution to the author(s) and the title of the work, journal citation and DOI.
Published under licence by IOP Publishing Ltd 1
ICCGANT IOP Publishing
IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018)
1234567890 ‘’“” 012052 doi:10.1088/1742-6596/1008/1/012052

Figure 1. Amal(Gi , v) where Gi ∼

= P(3,2)i with t = 3

Darmawan in [4] determined the rainbow connection number of special graphs and product
of two graphs on his thesis in 2015. One of his result is the rainbow connection number and
strong rainbow connection number of prism graph.

Theorem 1.1 For every integer m ≥ 3 and n ≥ 1, the rainbow connection number and strong
rainbow connection number of prism graph Pm,n are


n, for m = 3
rc(Pm,n ) = src(Pm,n ) =
dm
2 e + (n − 1), for m ≥ 4

In 2016, Salman and Fitriani [5] provide a sharp lower and upper bound for the rainbow
connection number of amalgamation of arbitrary graphs.

Theorem 1.2 For t ∈ N , t ≥ 2, let {Gi |i ∈ {1, 2, . . . , t}} be a finite collection of graphs and
each Gi has a fixed vertex v called a terminal. If G is the amalgamation of G1 , G2 , . . . , Gt ,
Amal(Gi , v0i ), then

t
X
diam(G) ≤ rc(G) ≤ rc(Gi )
i=1

2. The Results
This following section provides the theorem of the rainbow connection number and strong
rainbow connection number of prism graph P3,2 . See Figure 3 and Figure 7 for the ilustration.

Theorem 2.1 Let t be a positive integer with t ≥ 2. If G ∼ = Amal(Gi , v) where for each
i ∈ {1, 2, . . . , t}, Gi is a prism graph P3,2 , then rc(G) = 4.

Proof. We can check that diam(G) = 4. From Theorem 1.2 we have

t
X
diam(G) ≤ rc(G) ≤ rc(Gi )
i=1

2
ICCGANT IOP Publishing
IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018)
1234567890 ‘’“” 012052 doi:10.1088/1742-6596/1008/1/012052

Figure 2. The rainbow coloring on the i-th component of the Amalgamation

t
X
4 ≤ rc(G) ≤ rc(P(3,2)i )
i=1
4 ≤ rc(G) ≤ 2t

So the possible value of rainbow connection number from G are 4, 5, 6 . . . , 2t, such that the
rainbow connection has a lower bound diam(G) = 4. We can show that rc(G) = 4 with
the coloring c on the i − th component graph is as shown in Figure 2. We define coloring
c : E(G) → {1, 2, 3, 4} as follows.



 1, e = vi1 vi4 ; e = vi1 vi5 ; e = vi4 vi5
2, e = vvi1

c(e) =

 3, e = vvi2 ; e = vvi3 e = vi2 vi3 ,
4, e = vix vi(x+2) , with x = 2, 3


Now we need to proof for every two vertices vix , vjy ∈ V there exist a rainbow path.

For i = j we have d(vix , vjy ) ≤ 2, we can respectively choose rainbow path as follow. For v
to vi1 we have path v − vi1 with rainbow coloring c(vvi1 ) = 2, v to vi2 we have path v − vi2 with
rainbow coloring c(vvi2 ) = 3, v to vi3 we have path v − vi3 with rainbow coloring c(vvi3 ) = 3,
v to vi4 we have path v − vi1 − vi4 with rainbow coloring c(vvi1 ) = 2 and c(vi1 vi4 ) = 1, v to
vi5 we have path v − vi1 − vi5 with rainbow coloring c(vvi1 ) = 2 and c(vi1 vi5 ) = 1, vi1 to vi2
we have path vi1 − vi4 − vi2 with rainbow coloring c(vi1 vi4 ) = 1 and c(vi4 vi2 ) = 4, vi1 to vi3 we
have path vi1 − vi5 − vi3 with rainbow coloring c(vi1 vi5 ) = 1 and c(vi5 vi3 ) = 4, vi1 to vi4 we have
path vi1 − vi4 with rainbow coloring c(vi1 vi4 ) = 1, vi1 to vi5 we have path vi1 − vi5 with rainbow
coloring c(vi1 vi5 ) = 1, vi2 to vi3 we have path vi2 − vi3 with rainbow coloring c(vi2 vi3 ) = 3,
vi2 to vi4 we have path vi2 − vi4 with rainbow coloring c(vi2 vi4 ) = 4, vi2 to vi5 we have path
vi2 − vi4 − vi5 with rainbow coloring c(vi2 vi4 ) = 4 and c(vi4 vi5 ) = 1, vi3 to vi4 we have path
vi3 − vi5 − vi4 with rainbow coloring c(vi3 vi5 ) = 4 and c(vi5 vi4 ) = 1, vi3 to vi5 we have path
vi3 − vi5 with rainbow coloring c(vi3 vi5 ) = 4, vi4 to vi5 we have path vi4 − vi5 with rainbow
coloring c(vi4 vi5 ) = 1.

For i 6= j we consider in 3 cases,

Case 1. vix − vjy with x, y ∈ {1, 2, 3} (outer to outer vertices)

3
ICCGANT IOP Publishing
IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018)
1234567890 ‘’“” 012052 doi:10.1088/1742-6596/1008/1/012052

Figure 3. A rainbow 4-coloring of Amal(Gi , v) where Gi ∼

= P3,2 and t = 5

we can choose path vix − v − vj1 − vj(y+2) − vjy with c(vix v) = 3, c(vvj1 ) = 2, c(vj1 vj(y+2) ) =
1, c(vj(y+2) vjy ) = 4

Case 2. vix − vjy with x ≤ 3 and y > 3 (outer to inner vertices)

we can easily choose path vix − v − vj1 − vjy , with c(vix v) = 3, c(vvj1 ) = 2, c(vj1 vjy ) = 1.

Case 3. vix − vjy with x, y > 3 (inner to inner vertices)

we can choose path vix − vi1 − v − vj(y−2) − vjy , with c(vix vi1 ) = 1, c(vi1 v) = 2, c(vvj(y−2) ) =
3, c(vj(y−2) vjy ) = 4

Since 4 is the lower bound of rainbow connection number from amalgamation graf prism P3,2
and there is a rainbow path for every two vertices vix , vjy ∈ V , then rc(G) = 4. 
See Figure 3 for the illustration.

Theorem 3.1 Let t be a positive integer with t ≥ 2 and G ∼ = Amal(Gi , v) where for each
i ∈ {1, 2, . . . , t}, Gi is a prism graph P3,2 . Then src(G) = max {4, t}

Proof. Clearly 4 = diam(G) is a lower bound for src(G). Now, if you want to find a geodesic
path from any two vertices from different component graph, it needs to pass the terminal vertex
(v). Hence, src(G) = max{4, t}. For t = 2 and t = 3, we can find the coloring trivially as stated
in Figure 4 and Figure 5 respectively.
As for the case when t ≥ 4, let c : E(G) → {1, 2, . . . , t} be the following coloring:

 i, if e = vvik with k = 1, 2, 3 or e = vi2 vi3
c(e) = i + 1, if e = vi1 vik with k = 4, 5 or e = vi4 vi5
i + 2, if e = vik vi(k+2) with k = 2, 3


See Figure 6 as illustration for the coloring. We need to show that for all vix , vjy ∈ V , we
can provide a strong rainbow path which connecting vix and vjy .

If i = j, then we have d(vix , vjy ) ≤ 2. We can provide geodesic paths as follows. For v to vi1
we have geodesic path v − vi1 with strong rainbow coloring c(vvi1 ) = i, v to vi2 we have geodesic

4
ICCGANT IOP Publishing
IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018)
1234567890 ‘’“” 012052 doi:10.1088/1742-6596/1008/1/012052

Figure 4. A strong rainbow 4-coloring of Amal(Gi , v) where Gi ∼

= P3,2 and t = 2

Figure 5. A strong rainbow 4-coloring of Amal(Gi , v) where Gi ∼

= P3,2 and t = 3

Figure 6. The strong rainbow coloring on the i-th component of the Amalgamation. All color
are in mod t.

5
ICCGANT IOP Publishing
IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018)
1234567890 ‘’“” 012052 doi:10.1088/1742-6596/1008/1/012052

path v − vi2 with strong rainbow coloring c(vvi2 ) = i, v to vi3 we have geodesic path v − vi3
with strong rainbow coloring c(vvi3 ) = i, v to vi4 we have geodesic path v − vi1 − vi4 with strong
rainbow coloring c(vvi1 ) = i and c(vi1 vi4 ) = i + 1, v to vi5 we have geodesic path v − vi1 − vi5
with strong rainbow coloring c(vvi1 ) = i and c(vi1 vi5 ) = i + 1, vi1 to vi2 we have geodesic path
vi1 −vi4 −vi2 with strong rainbow coloring c(vi1 vi4 ) = i+1 and c(vi4 vi2 ) = i+2, vi1 to vi3 we have
geodesic path vi1 − vi5 − vi3 with strong rainbow coloring c(vi1 vi5 ) = i + 1 and c(vi5 vi3 ) = i + 2,
vi1 to vi4 we have geodesic path vi1 − vi4 with strong rainbow coloring c(vi1 vi4 ) = i + 1, vi1 to vi5
we have geodesic path vi1 − vi5 with strong rainbow coloring c(vi1 vi5 ) = i + 1, vi2 to vi3 we have
geodesic path vi2 − vi3 with strong rainbow coloring c(vi2 vi3 ) = i, vi2 to vi4 we have geodesic
path vi2 − vi4 with strong rainbow coloring c(vi2 vi4 ) = i + 2, vi2 to vi5 we have geodesic path
vi2 −vi4 −vi5 with strong rainbow coloring c(vi2 vi4 ) = i+2 and c(vi4 vi5 ) = i+1, vi3 to vi4 we have
geodesic path vi3 − vi5 − vi4 with strong rainbow coloring c(vi3 vi5 ) = i + 2 and c(vi5 vi4 ) = i + 1,
vi3 to vi5 we have geodesic path vi3 − vi5 with strong rainbow coloring c(vi3 vi5 ) = i + 2, vi4 to
vi5 we have geodesic path vi4 − vi5 with strong rainbow coloring c(vi4 vi5 ) = i + 1.

For i 6= j, we consider 3 cases,

Case 1. vix − vjy with x, y = 2 and x, y = 3 (outer to outer)

Clearly d(vix , vjy ) = 2, then we can choose the geodesic path vix − v − vjy with color c(vix v) = i
and c(vvyj ) = j.

Case 2. vix − vjy with x ≤ 3 and y > 3 (outer to inner)

We have d(vix vjy ) ≤ 3
Subcase 2.1. If (i − j) ≡ 1 mod t we obtain i ≡ (j + 1) mod then we can choose the
geodesic path vix − v − vj(y−2) − vjy , with c(vix v) = i, c(vvj(y−2) ) = j, c(vj(y−2) vjy ) = j + 2
Subcase 2.2. If (i − j) 6= 1 mod t we obtain i 6= (j + 1) mod then we can choose the
geodesic path vix − v − vj1 − vjy , with c(vix v) = i, c(vvj1 ) = j, c(vj1 vjy ) = j + 1

Case 3. vix − vjy with x, y > 3

Subcase 3.1. for |i − j| ≡ 1 mod t we can choose the geodesic path vix − vi(x−2) − v−
vj(y−2) −vjy , with c(vix vi(x−2) ) = i+2, c(vi(x−2) v) = i, c(vvj(y−2) ) = j, c(vj(y−2) vjy ) = j+2
Subcase 3.2. for |i − j| = 6 1 mod t we can choose the geodesic path vix − vi1 − v−
vj1 − vjy , with c(vix vi1 ) = i + 1, c(vi1 v) = i, c(vvj1 ) = j, c(vj1 vjy ) = j + 1
Since all paths chosen are geodesic and of different colors, then c is strong rainbow coloring. 
See Figure 7 for the illustration.

3. Conclusion
We have studied the rainbow connection number and strong rainbow connection number
from amalgamation of prism graph P3,2 . The result show that all the rainbow connection num-
ber and strong rainbow connection number in this paper achieve the minimum value by using
deductive reasoning methods, through the following theorem: Let t be a positive integer with
t ≥ 2 and G ∼= Amal(Gi , v) where for each i ∈ {1, 2, . . . , t}, Gi is a prism graph P3,2 . Then
rc(G) = 4 and src(G) = max {4, t}.

Open Problem
We have a few problems that we would like to investigate further in this topic such that
finding the rainbow connection and strong rainbow connecton number of:
(i) amalgamation of prism graph Pm,n ;

6
ICCGANT IOP Publishing
IOP Conf. Series: Journal of Physics: Conf. Series 1008 (2018)
1234567890 ‘’“” 012052 doi:10.1088/1742-6596/1008/1/012052

Figure 7. A strong rainbow 5-coloring of Amal(Gi , v) where Gi ∼

= P3,2 and t = 5

(ii) amalgamation of any graph G in general.

Acknowledgement
We gratefully acknowledge the support from Faculty of Sciences and Technology UIN Syarif
Hidayatullah Jakarta.

References
[1] Chartrand, et all, Rainbow connection in graphs, Math. Bohem. 133, 85-98, 2008
[2] Chartrand, et all, Applied and Algoritmic Graph Theory, New York: Mac Graw-Hill, inc, 1993
[3] Rosen, K, Discrete Mathematics and Its Applications, New York: Mac Graw-Hill, inc, 2012
[4] Darmawan, Analisis Rainbow Connection Number pada Graf Khusus dan Hasil Operasinya, Graduate Thesis,
Pascasarjana Universitas Jember, 2015
[5] Salman and Fitriani, Rainbow Connection Number of Amalgamation of Some Graphs, AKCE International
J. Graph and Combinatorics (13), 90-99, 2016
[6] Salman and Kumala, The Rainbow Connection Number of a Flower (Cm , Kn ) Graph and a Flower (C3 , Fn )
graph, Procedia Computer Science 74, 168-172, 2015
[7] Sugeng, et all, Teori Graf dan Aplikasinya, Indonesia: Departemen Matematika Universitas Indonesia, 2018
[8] Vilfred, A Theory of Cartesian Product and Factorization of Circulant Graphs, Hindawi Publishing
Corporation, 1-10, 2013
[9] X. Li, Y. Sun, Characterization of graphs with large rainbow connection number and rainbow connection
number of some graph operations, Discrete Math, 2016
[10] X. Li, Y. Shi, Y. Sun, Rainbow connection of graphs: a survey, Graph Combin, 29 (1) 1-38, 2013
[11] X. Li, Y. Sun, Rainbow connection of graphs, Springer-Verlag, New York, 2012