The Antimagic Rainbow Vertex Connection of Tree Graphs |

1 www.ijc.or.id
 Indonesian Journal of Combinatorics x (x) (2021), 1–8

The Antimagic Rainbow Vertex Connection of

Tree Graphs
Ika Hesti Agustina , Elsa Yuli Kurniawatib
a Department of Mathematics, University of Jember, Indonesia
b CGANT-University of Jember, Indonesia

Abstract
Let G(V (G), E(G)) be a connected, simple, and finite graph. Let f be a bijective function of
labeling on graph G from the edge set E(G) to natural number up to the number of edges of G.
An antimagic rainbow edge labeling is function f under the condition all internal vertices of a path
u − v for any two vertices u and v have different weight (denoted by w(u), ∀u ∈ V (G)), where
w(u) = Σuu0 ∈E(G) f (uu0 ). If G has a antimagic rainbow edge labeling, then G is a antimagic
rainbow vertex connection, where the every vertex is assigned with the color w(u). The antimagic
rainbow vertex connection number of G, denoted by arvc(G), is the minimum colors taken over
all rainbow vertex connection induced by antimagic rainbow edge labeling of G. In this paper,
we determined the exact value of the antimagic rainbow vertex connection number of star (Sn ),
double star (DSn ), and broom graph (Brn,m ).
Keywords: antimagic rainbow vertex connnection, antimagic rainbow vertex connection number, antimagic labeling, rainbow
vertex connection
Mathematics Subject Classification : 05C15, 05C78

1. Introduction
Graph coloring is the famous topics in graph theory. Many types of colorings and connectivity
measures have been study with many researchers. The antimagic rainbow coloring is a combination
of three concept namely coloring, labeling and connectivity, and this topics was first defined by
Septory et al [1]. Many famous researchers have worked on antimagic rainbow coloring. They
found new results and it has many contributions in graph theory, especially in rainbow coloring or
rainbow connection.

Received: xx xxxxx 20xx, Accepted: xx xxxxx 20xx.

2 www.ijc.or.id
 The Antimagic Rainbow Vertex Connection of Tree Graphs |

All graphs considered in this paper are simple, finite and undirected. We follow the terminology
and notation about the graph by Chartrand et al [2]. The concept of rainbow connection was
introduced by Chartrand et al [3] in 2008. A path is rainbow if no two edges of it are colored
the same. An edge-coloring graph G is rainbow connected if every two vertices are connected
by a rainbow path. An edge-coloring under which G is rainbow connected is called a rainbow
connection coloring. The concept of rainbow connection has several interesting variants, one of
them is rainbow vertex-connection. It was introduced by Krivelevich and Yuster [4].
Let G be a nontrivial connected graph with an edge-coloring c : E(G) → 1, 2, 3, . . . , k, k ∈ N ,
where adjacent edges may be colored the same. A path P of G is a rainbow path if no two edges
of P are colored the same. The graph G is called rainbow-connected if for any pair of vertices u
and v of G, there is a rainbow uv path [5, 6].
Similar to the concept of the rainbow connection number. A vertex-colored graph is rainbow
vertex-connected if any two vertices are connected by a path whose internal vertices have distinct
colors. In particular, if k colors are used, then G is rainbow k-vertex-connected. The rainbow
vertex-connection number of a connected graph G , denoted by rvc(G), is the smallest number of
colors that are needed in order to make G rainbow vertex-connected. Krivelevich and Yuster [4]
gave the lower bound for rvc(G), namely rvc(G) ≥ diam(G) − 1. There are many interesting
results about rainbow connection numbers and rainbow vertex-connection numbers. The result of
rainbow vertex connection number can be seen on [5, 6, 7] .
Marsidi et al [8] develop a new concept namely antimagic rainbow vertex connection. The
concept of antimagic labeling can be seen on [9] and the concept of antimagic rainbow coloring
have studied by [8, 10, 11]. Let f : E(G) → 1, 2, 3, . . . , |E(G)| be a labeling of a graph G.
The function g is called antimagic rainbow edge labeling if for any two vertices u and v, all
internal vertices in path u − v have different weight. The vertex weight denoted by w(u) for every
u ∈ V (G), where w(u) = Σuu0 ∈E(G) f (uu0 ). If G has a antimagic rainbow edge labeling, then G
is a antimagic rainbow vertex connection, where the every vertex is assigned with the color w(u).
The antimagic rainbow vertex connection number of G, denoted by arvc(G), is the minimum
colors taken over all rainbow vertex connection induced by antimagic rainbow edge labeling of
G. In this paper, we determine the exact value of antimagic rainbow vertex connection number of
family tree graphs namely star Sn , double star DSn,m , and broom Brn,m .

2. Preliminaries on Antimagic Rainbow Vertex Connection

In previous studies, Marsidi et al. [8] have determined the lower bound of antimagic rainbow
vertex connection number as follows. The resulted lower bound can be used to determine the
antimagic rainbow vertex connection number for any graph.
Remark 2.1. [8] Let G be a connected graph, arvc(G) ≥ rvc(G).
Based on Remark 2.1, we determined specifically the lower bound of antimagic rainbow ver-
tex connection number for graphs belonging to the family tree graph. The lower bound of the
antimagic rainbow vertex connection number is presented in Lemma 2.1.

3 www.ijc.or.id
 The Antimagic Rainbow Vertex Connection of Tree Graphs |

Lemma 2.1. Let T be a tree graph of order p has l pendant vertices,


 rvc(T ), if l < p − l
arvc(T ) ≥
l + 1, if l ≥ p − l.


Proof. Let T be a tree graph of order p has l pendant vertices and f be function under the antimagic
rainbow edge labeling. Since l < p − l, then base on Remark 2.1 it gives arvc(T ) ≥ rvc(T ). Let
v ∈ V (T ) is a pendant vertex. Since vertex v is assigned with the color w(v), then w(v) = f (e)
where e is incident edge with v. Hence all the pendant vertices receive distinct colors. Furthermore,
for l ≥ p − l any non-pendant vertex v 0 incident with an edge e0 with f (e0 ) = s, the color assigned
to v 0 is larger than s. Hence the number of colors in the vertex coloring induced by f is at least
l + 1. It concludes that arvc(T ) ≥ l + 1. 2

3. Results and Discussions

The results of this study are new theorems regarding the antimagic rainbow vertex connection
number.

Theorem 3.1. Let Br4,m be a broom graph. For every positive integer m ≥ 2,

arvc(Br4,m ) = m + 2.

Proof. Let Br3,m be a broom graph with vertex set V (Br4,m ) = {ui , vj : 1 ≤ i ≤ 4, 1 ≤ j ≤ m}
and edge set E(Br4,m ) = {u1 u2 , u2 u3 , u3 u4 , u4 vj : 1 ≤ i ≤ n, 1 ≤ j ≤ m}. Graph Br4,m
has m + 1 pendant vertices. Since l ≥ p − l or m + 1 ≥ 3, based on Lemma 2.1 we have
arvc(Br4,m ) ≥ l + 1 = m + 1 + 1 = m + 2. We determine the upper bound of arvc(Br4,m ) by
bijective function of edge labels as follows.

g3 (u1 u2 ) = 3

g3 (u2 u3 ) = 1
g3 (u3 u4 ) = 2
g3 (u4 vj ) = 3 + j : 1 ≤ j ≤ m
The vertex weight can be determined from the edge label function, such that we obtain:

w(u1 ) = 3

w(u2 ) = 4
w(u3 ) = 3
m(m + 1)
w(u4 ) = 2 + 3m +
2

4 www.ijc.or.id
 The Antimagic Rainbow Vertex Connection of Tree Graphs |

Table 1. The Rainbow Vertex of u − u0 Path of Br4,m

Case u u0 Condition Rainbow Vertex Connection u − u0
1 ui uj i<j ui , ui+1 , ui+2 , . . . , uj
2 ui uj i>j ui , ui−1 , ui−2 , . . . , uj
3 ui vj 1 ≥ i ≥ 4, and 1 ≥ j ≥ m ui , . . . , u1 , vj
4 vi vj vi , u1 , vj

w(vj ) = 3 + j : 1 ≤ j ≤ m
Based on the vertex weights above, we know that the double star graph (Br4,m ) has m + 2
different weights. Since every vertex u ∈ V (Sn ) is assigned with the color w(u), then internal
vertices for every two different vertices have different weights. For more detail, it can be seen
Table 1. Suppose that u, u0 ∈ V (Br4,m ), then there are three cases of paths in Br4,m as follows.
From the Table 1, we can concludes that star graph (Br4,m ) is antimagic rainbow vertex con-
nection. Thus, we obtain arvc(Br4,m ) = m + 2.

5 www.ijc.or.id
 The Antimagic Rainbow Vertex Connection of Tree Graphs |

Theorem 3.2. Let Brn,3 be a broom graph. For every positive integer n ≥ 3,

 5, if n = 3, 4, 5
arvc(Brn,3 ) ≥
n − 1, if n ≥ 6.


Proof. Let Brn,3 be a broom graph with vertex set V (Brn,3 ) = {ui , vj : 1 ≤ i ≤ n, 1 ≤ j ≤ 3}
and edge set E(Brn,3 ) = {ui ui+1 , u1 vj : 1 ≤ i ≤ n − 1, 1 ≤ j ≤ 3}. Graph Brn,3 has 3 + 1 = 4
pendant vertices and diam(Brn,3 ) = n. For n = {3, 4, 5}, since l ≥ p − l then based on Lemma
2.1 we have arvc(Brn,3 ) ≥ l + 1 = 4 + 1 = 5. For n ≥ 6, since it has p − l > l or n − 1 > 4,
then based on Lemma 2.1 we have arvc(Brn,3 ) ≥ rvc(Brn,3 ) = diam(Brn,3 ) − 1 = n − 1.
Furthermore, we determine the upper bound of arvc(Brn,3 ) by bijective function of edge labels as
follows. For n = {3, 4, 5, 6}, we show the edge labels in Figure 3.

Figure 1. The Edge Labels on Brn,3 : n = {3, 4, 5, 6}

Based on Figure 3, it is easy to see that graph Brn,3 : n = {3, 4, 5, 6} have 5 different weights
and internal vertices for every two different vertices have different weights. For n ≥ 6, there are
two cases, namely for n odd and n even as follows.
Case 1. For n Odd  i+1
 2 , if i odd
g4 (ui ui+1 ) =
 n−1+i
2
, if i even .
g4 (u1 vj ) = n − 1 + j : 1 ≤ j ≤ 3

6 www.ijc.or.id
 The Antimagic Rainbow Vertex Connection of Tree Graphs |

The vertex weight can be determined from the edge label function, such that we obtain:

w(u1 ) = 3n + 4
n−1
w(ui ) = +i:2≤i≤n−1
2
w(un ) = n − 1
w(vj ) = n − 1 + j : 1 ≤ j ≤ 3
Case 2. For n Even  i
 2, if i even
g4 (ui ui+1 ) =
n−3+i
, if i odd .

2

g4 (u1 vj ) = n − 2 + j : 1 ≤ j ≤ 3
g4 (u1 u2 ) = n + 2
The vertex weight can be determined from the edge label function, such that we obtain:

w(u1 ) = 4n + 2

w(u2 ) = n + 3
n−4
w(ui ) = +i:3≤i≤n−1
2
w(un ) = n − 2
w(vj ) = n − 2 + j : 1 ≤ j ≤ 3
Based on the vertex weights above, we know that the double star graph (Brn,3 ) has 5 different
weights if n = {3, 4, 5} and n − 1 if n ≥ 6. Since every vertex u ∈ V (Sn ) is assigned with the
color w(u), then internal vertices for every two different vertices have different weights. For more
detail, it can be seen Table 2. Suppose that u, u0 ∈ V (Brn,3 ), then there are three cases of paths in
Brn,3 as follows.

Table 2. The Rainbow Vertex of u − u0 Path of Brn,3

Case u u0 Conditions Rainbow Vertex Connection u − u0
1 ui uj i<j ui , ui+1 , ui+2 , . . . , uj
2 ui uj i>j ui , ui−1 , ui−2 , . . . , uj
3 ui vj 1 ≥ i ≥ n, and 1 ≥ j ≥ 3 ui , . . . , u1 , vj
4 vi vj vi , u1 , vj

From the Table 2, we can concludes that star graph (Brn,3 ) is antimagic rainbow vertex con-
nection. Thus, we obtain arvc(Brn,3 ) = 5 if n = {3, 4, 5} and arvc(Brn,3 ) = n − 1 if n ≥ 6.

7 www.ijc.or.id
 The Antimagic Rainbow Vertex Connection of Tree Graphs |

Acknowledgement
We gratefully acknowledge to Department of Mathematics Education, Universitas PGRI Ar-
gopuro Jember, CGANT University of Jember in 2021, and the reviewers who have make some
corrections in completing this paper.

References
[1] B J Septory, M I Utoyo, Dafik, B Sulistiyono, I H Agustin, On rainbow antimagic coloring
of special graphs, Journal of Physics: Conference Series 1836 (2021), 012016.

[2] G. Chartrand, L. Lesniak and P. Zhang, Graphs Digraphs Sixth Edition, Taylor Francis
Group (2016).

[3] G. Chartrand, G.L. Johns, K.A. McKeon, P. Zhang, Rainbow connection in graphs, Math.
Bohem. 133 (2008), 85—98.

[4] M. Krivelevich, R. Yuster, The rainbow connection of a graph is (at most) reciprocal to its
minimum degree, J. Graph Theory 63 (2010), 185–191.

[5] L. Chen, X. Li, Y. Shi, The complexity of determining the rainbow vertex-connection of
graph, Theoretical Computer Science 412 (2011), 4531–4535.

[6] Lily Chen, Xueliang Li, Huishu Lian, Further hardness results on the rainbow vertex-
connection number of graphs, Theoretical Computer Science 481 (2013), 18–23.

[7] Dian N.S. Simamora, A.N.M. Salman, The Rainbow (Vertex) Connection Number of Pencil
Graphs, Procedia Computer Science 74 (2015) 138—142.

[8] Marsidi, I.H. Agustin and E.Y. Kurniawati, On The Antimagic Rainbow Vertex Connection
of Graphs, Cauchy, (2021).

[9] F. Chang, Y.C. Liang, Z. Pan, X. Zhu, Antimagic labeling of regular graphs, J. Graph Theory
82 (2016), 339–349.

[10] Z.L. Al Jabbar, Dafik, R Adawiyah, E R Albirri, I H Agustin, On rainbow antimagic coloring
of some special graph, Journal of Physics: Conference Series 1465 (2020) 012030.

[11] H S Budi, Dafik, I M Tirta, I H Agustin and A I Kristiana, On rainbow antimagic coloring of
graphs, Journal of Physics: Conference Series 1832 (2021) 012016.

8 www.ijc.or.id