Journal of Physics: Conference Series

PAPER • OPEN ACCESS

The Total Edge Irregularity Strength of Uniform Theta Graphs

To cite this article: R W Putra and Y Susanti 2018 J. Phys.: Conf. Ser. 1097 012069

View the article online for updates and enhancements.

This content was downloaded from IP address 191.96.252.175 on 12/10/2018 at 13:20

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

The Total Edge Irregularity Strength of Uniform Theta Graphs

R W Putra and Y Susanti

Department of Mathematics Faculty of Mathematics and Natural Sciences Universitas
Gadjah Mada Indonesia

Email: riyan.wicaksana.p@mail.ugm.ac.id

Abstract. This research is a development work on the total edge irregularity strength of series-
parallel graphs. The total edge irregularity strength of series composition of isomorphic uniform
theta graphs has been determined. But the total edge irregularity strength of uniform theta graphs
itself is an open problem. In this paper, we determine the total edge irregularity strength of
uniform theta graphs with one variable is fixed. In the end we determine the total edge irregularity
strength of uniform theta graphs in general.

1. Introduction
Let 𝐺 = (𝑉(𝐺), 𝐸(𝐺)) be simple, connected, and undirected graph with vertex set 𝑉(𝐺) and edge set
𝐸(𝐺). Let Δ(𝐺) be the maximum degree of vertices of 𝐺. For the rest term used in this paper see [1]. A
labeling on a graph is a map that carries graph elements, e.g. vertices, edges, or both, to numbers (usually
to the positive or non-negative integers) [10]. A labeling with edges and vertex sets as the domain is
called total labeling (total 𝑘-labeling if 𝑘 is the maximum label). The interesting thing about total
labeling is that one can consider the weight of graph’s element. In [4], Wallis defined the weight of edge
𝑥𝑦 under the total labeling 𝜆 as
𝑤𝑡𝜆 (𝑥𝑦) = 𝜆(𝑥) + 𝜆(𝑥𝑦) + 𝜆(𝑦). (1)
By this notion, Wallis in [4] defined edge-magic labeling, a total labeling which every edge has the same
weight. Inspired by that, in opposite, Bača et al. in [3] defined edge irregular total labeling, a total
labeling which every two edges have different weights. In particular, irregular total labeling with
maximum label 𝑘 is called irregular total 𝑘-labeling. A question arose from edge irregular labeling is
whether we can determine the minimum value of the largest label for certain graphs. This minimum
value for graph 𝐺 is then called total edge irregularity strength of 𝐺, and denoted by 𝑡𝑒𝑠(𝐺).
In [3], Bača et al. managed to determine the lower bound of total edge irregularity strength of any
graphs. Moreover, they also determine the exact value of total edge irregularity strength of path, cycle,
wheel, and friendship graphs. The lower bound of total edge irregularity strength of given graph 𝐺 =
(𝑉(𝐺), 𝐸(𝐺)) is given by the following
|𝐸(𝐺)|+2 Δ(𝐺)+1
𝑡𝑒𝑠(𝐺) ≥ 𝑚𝑎𝑥 {⌈ ⌉,⌈ ⌉}. (2)
3 2
Then, Ivanco and Jendrol in [2] determine the value of total edge irregularity strength of trees. They
also gave the conjecture of total edge irregularity strength of any graph not isomorphic with 𝐾5 as
follows.
Conjecture 1. [2] Let 𝐺 be an arbitrary graph different from 𝐾5 . Then,
|𝐸(𝐺)|+2 Δ+1
𝑡𝑒𝑠(𝐺) = 𝑚𝑎𝑥 {⌈ ⌉ , ⌈ ⌉}. (3)
3 2

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
ICRIEMS 5 IOP Publishing
IOP Conf. Series: Journal of Physics: Conf. Series 1097 (2018)
1234567890 ‘’“” 012069 doi:10.1088/1742-6596/1097/1/012069

The conjecture above is widely known in graph theory research, particularly in graph labeling. For
more result see [5-11]. In [7], Rajasingh and Arockiamary supported Conjecture 1 for series-parallel
graphs, namely series-composition of isomorphic uniform the graphs 𝜃(𝑛; 𝑚; 𝑟), i.e. 𝑟 collections of
uniform theta graph 𝜃(𝑛; 𝑚) which are arranged in series-composition. The vertices and edges of
𝜃(𝑛; 𝑚; 𝑟), with 𝑛 ≥ 3, 𝑚 ≥ 1, and 𝑟 ≥1 are listed in its vertices set and edges set below.
𝑉(𝜃(𝑛; 𝑚; 𝑟)) = {𝑐0 , 𝑐𝑘 , 𝑥𝑖,𝑗,𝑘 |1 ≤ 𝑖 ≤ 𝑛; 1 ≤ 𝑗 ≤ 𝑚; 1 ≤ 𝑘 ≤ 𝑟}, and
𝐸(𝜃(𝑛; 𝑚; 𝑟)) = {𝑐𝑘−1 𝑥𝑖,1,𝑘 |1 ≤ 𝑖 ≤ 𝑛; 1 ≤ 𝑘 ≤ 𝑟}
∪ {𝑥𝑖,𝑚,𝑘 𝑐𝑘 |1 ≤ 𝑖 ≤ 𝑛; 1 ≤ 𝑘 ≤ 𝑟}
∪ {𝑥𝑖,𝑗−1,𝑘 𝑥𝑖,𝑗,𝑘 |1 ≤ 𝑖 ≤ 𝑛; 2 ≤ 𝑗 ≤ 𝑚; 1 ≤ 𝑘 ≤ 𝑟}.
While for uniform theta graph 𝜃(𝑛; 𝑚), with 𝑛 ≥ 3, 𝑚 ≥ 1, we have
𝑉(𝜃(𝑛; 𝑚)) = {𝑐0 , 𝑐1 , 𝑥𝑖,𝑗 |1 ≤ 𝑖 ≤ 𝑛; 1 ≤ 𝑗 ≤ 𝑚}, and
𝐸(𝜃(𝑛; 𝑚)) = {𝑐0 𝑥𝑖,1 , 𝑥𝑖,𝑚 𝑐1 , 𝑥𝑖,𝑗−1 𝑥𝑖,𝑗 |1 ≤ 𝑖 ≤ 𝑛; 2 ≤ 𝑗 ≤ 𝑚}.
It is easy to see that series-composition of isomorphic uniform theta graph with 𝑟 = 1 is isomorphic
with uniform theta graph itself. Figure 1 and 2 shows 𝜃(4; 3; 2) and 𝜃(4; 3), respectively.

Figure 1. Series-composition of isomorphic uniform theta graph 𝜃(4; 3; 2)

Figure 2. Uniform theta graph 𝜃(4; 3)

The total edge irregularity strength of series-composition of isomorphic uniform theta graph is given
below.
Theorem 2. [7] Let 𝜃(𝑛; 𝑚; 𝑟), 𝑟 ≥ 2, be series-composition of isomorphic uniform theta graph.
Then,
𝑟𝑛(𝑚+1)+2
𝑡𝑒𝑠(𝜃(𝑛; 𝑚; 𝑟)) = ⌈ ⌉.
3
However, the total edge irregularity strength of uniform theta graph or series-composition of
isomorphic uniform theta graph with 𝑟 = 1, or simply uniform theta graph, is remained unanswered. In
this paper, we determine the total edge irregularity strength of uniform theta graph.

2
ICRIEMS 5 IOP Publishing
IOP Conf. Series: Journal of Physics: Conf. Series 1097 (2018)
1234567890 ‘’“” 012069 doi:10.1088/1742-6596/1097/1/012069

2. Results
Our aim is to determine the total edge irregularity strength of uniform theta graph 𝜃(𝑛; 𝑚). So, we start
from the very simple case of uniform theta graph 𝜃(3; 1). The total edge irregularity strength of uniform
theta graph 𝜃(3; 1) is 3 with the labeling given by Fig. 3.

Figure 3. Irregular total 3-labeling for uniform theta graph 𝜃(3; 1)

We extend our work to determine the total edge irregularity strength of uniform theta graph 𝜃(3; 𝑚)
with 𝑚 ≥ 1 and of uniform theta graph 𝜃(𝑛; 1) with 𝑛 > 3. The obtained result for theta graph 𝜃(3; 𝑚)
with 𝑚 ≥ 1 is given by the following lemma.

Lemma 3. Let 𝜃(3; 𝑚), 𝑚 > 1, be a uniform theta graph. Then, 𝑡𝑒𝑠(𝜃(3; 𝑚)) = 𝑚 + 2.
Proof. Uniform theta graph 𝜃(3; 𝑚) has |𝐸(𝜃(3; 𝑚))| = 3(𝑚 + 1) and Δ(𝜃(3; 𝑚)) = 3. By (2), we
have
|𝐸(𝜃(3;𝑚))|+2 Δ(𝜃(3;𝑚))+1
𝑡𝑒𝑠(𝜃(3; 𝑚)) ≥ 𝑚𝑎𝑥 {⌈ ⌉,⌈ ⌉}
3 2
= 𝑚𝑎𝑥{𝑚 + 2,2}
= 𝑚 + 2.
We only need to show that there exists an irregular total 𝑘-labeling for 𝜃(3; 𝑚) such that 𝑘 = 𝑚 + 2.
Let 𝑘 = 𝑚 + 2. We construct a total 𝑘-labeling 𝛼: 𝑉(𝜃(3; 𝑚)) ∪ 𝐸(𝜃(3; 𝑚)) → {1,2, ⋯ , 𝑘} as follows:
𝛼(𝑐0 ) = 1,
𝛼(𝑐1 ) = 𝑚 + 2,
𝛼(𝑥𝑖,𝑗 ) = 𝑗, for 𝑖 = 1 and 1 ≤ 𝑗 ≤ 𝑚,
𝛼(𝑥𝑖,𝑗 ) = 𝑗 + 𝑖 − 1, for 𝑖 = 2,3 and 1 ≤ 𝑗 ≤ 𝑚,
𝛼(𝑐0 𝑥𝑖,1 ) = 𝑖 + 2 − 𝛼(𝑐0 ) − 𝛼(𝑥𝑖,1 ), for 𝑖 = 1,2,3,
𝛼(𝑥𝑖,𝑚 𝑐1 ) = 3𝑚 + 𝑖 + 2 − 𝛼(𝑥𝑖,𝑚 ) − 𝛼(𝑐1 ), for 𝑖 = 1,2,3,
𝛼(𝑥𝑖,𝑗−1 𝑥𝑖,𝑗 ) = 3(𝑗 − 1) + 𝑖 + 2 − 𝛼(𝑥𝑖,𝑗−1 ) − 𝛼(𝑥𝑖,𝑗 ), for 𝑖 = 1,2,3 and 2 ≤ 𝑗 ≤ 𝑚.
By (1) we have that each weight of edges is given by the following
𝑤𝑡𝛼 (𝑐0 𝑥𝑖,1 ) = 𝑖 + 2, for 𝑖 = 1,2,3,
𝑤𝑡𝛼 (𝑥𝑖,𝑚 𝑐1 ) = 3𝑚 + 𝑖 + 2, for 𝑖 = 1,2,3,
𝑤𝑡𝛼 (𝑥𝑖,𝑗−1 𝑥𝑖,𝑗 ) = 3(𝑗 − 1) + 𝑖 + 2, for 𝑖 = 1,2,3 and 2 ≤ 𝑗 ≤ 𝑚.
It is easy to see that the weight of each edges are varying distinctively from 3 to 3𝑚 + 5. Therefore, 𝛼
is irregular total 𝑘-labeling with 𝑘 = 𝑚 + 2. So, we have 𝑡𝑒𝑠(𝜃(3; 𝑚)) = 𝑚 + 2. ∎

Next, we extend our work to determine the total edge irregularity strength of uniform theta graph
𝜃(𝑛; 1) with 𝑛 ≥ 3. We get the result as follows.

Lemma 4. Let 𝜃(𝑛; 1), 𝑛 > 3, be a uniform theta graph. Then, 𝑡𝑒𝑠(𝜃(𝑛; 1)) = ⌈(2𝑛 + 2)⁄3⌉.
Proof. Uniform theta graph 𝜃(𝑛; 1) has |𝐸(𝜃(𝑛; 1))| = 2𝑛 and Δ(𝜃(𝑛; 1)) = 𝑛. By (2), we have

3
ICRIEMS 5 IOP Publishing
IOP Conf. Series: Journal of Physics: Conf. Series 1097 (2018)
1234567890 ‘’“” 012069 doi:10.1088/1742-6596/1097/1/012069

|𝐸(𝜃(𝑛;1))|+2 Δ(𝜃(𝑛;1))+1
𝑡𝑒𝑠(𝜃(𝑛; 1)) ≥ 𝑚𝑎𝑥 {⌈ ⌉,⌈ ⌉}
3 2
2𝑛+2 n+1
= 𝑚𝑎𝑥 {⌈ ⌉ , ⌈ ⌉}
3 2
2𝑛+2
=⌈ ⌉.
3
It is sufficient to show that there exists an irregular total 𝑘-labeling for 𝜃(𝑛; 1) such that 𝑘 =
⌈(2𝑛 + 2)⁄3⌉. Let 𝑘 = ⌈(2𝑛 + 2)⁄3⌉. We construct a total 𝑘-labeling 𝛽: 𝑉(𝜃(𝑛; 1)) ∪ 𝐸(𝜃(𝑛; 1)) →
{1,2, ⋯ , 𝑘} as follows
𝛽(𝑐0 ) = 1,
2𝑛+2
𝛽(𝑐1 ) = ⌈ ⌉,
3
2𝑛+2 𝑛−1 𝑛−1
𝛽(𝑥𝑖,𝑗 ) = ⌈ ⌉+⌈ ⌉ − 𝑛, for 1 ≤ 𝑖 ≤ ⌈ ⌉,
3 3 3
2𝑛+2 𝑛−1
𝛽(𝑥𝑖,𝑗 ) = ⌈ ⌉ + 𝑖 − 𝑛, for ⌈ ⌉ + 1 ≤ 𝑖 ≤ 𝑛,
3 3
𝛽(𝑐0 𝑥𝑖,1 ) = 𝑖 + 2 − 𝛽(𝑐0 ) − 𝛽(𝑥𝑖,1 ), for 1 ≤ 𝑖 ≤ 𝑛,
𝛽(𝑥𝑖,1 𝑐1 ) = 𝑛 + 𝑖 + 2 − 𝛽(𝑥𝑖,1 ) − 𝛽(𝑐1 ), for 1 ≤ 𝑖 ≤ 𝑛.
By (1) we have each weight of edges as follows
𝑤𝑡𝛽 (𝑐0 𝑥𝑖,1 ) = 𝑖 + 2, for 1 ≤ 𝑖 ≤ 𝑛,
𝑤𝑡𝛽 (𝑥𝑖,1 𝑐1 ) = 𝑛 + 𝑖 + 2, for 1 ≤ 𝑖 ≤ 𝑛.
It is obvious that the weight of each edges are varying distinctively from 3 to 2𝑛 + 2. Hence, 𝛽 is
irregular total 𝑘-labeling with 𝑘 = ⌈(2𝑛 + 2)⁄3⌉. So, we have 𝑡𝑒𝑠(𝜃(𝑛; 1)) = ⌈(2𝑛 + 2)⁄3⌉. ∎
Finally, we wrap up our work by determining the total edge irregularity strength of uniform theta
graph 𝜃(𝑛; 𝑚) in the following theorem.

Theorem 5. Let 𝜃(𝑛; 𝑚), 𝑛 ≥ 3, 𝑚 ≥ 1, be a uniform theta graph. Then, 𝑡𝑒𝑠(𝜃(𝑛; 𝑚)) =
⌈(𝑛(𝑚 + 1) + 2)⁄3⌉.
Proof. Uniform theta graph 𝜃(𝑛; 𝑚) has |𝐸(𝜃(𝑛; 𝑚))| = 𝑛(𝑚 + 1) and Δ(𝜃(𝑛; 𝑚)) = 𝑛. By (2), we
have
|𝐸(𝜃(𝑛;1))|+2 Δ(𝜃(𝑛;1))+1
𝑡𝑒𝑠(𝜃(𝑛; 𝑚)) ≥ 𝑚𝑎𝑥 {⌈ ⌉,⌈ ⌉}
3 2
𝑛(𝑚+1)+2 n+1
= 𝑚𝑎𝑥 {⌈ ⌉ , ⌈ ⌉}
3 2
𝑛(𝑚+1)+2
= ⌈ ⌉.
3
We necessarily show that there is an irregular total 𝑘-labeling for 𝜃(𝑛; 𝑚) such that 𝑘 =
⌈(𝑛(𝑚 + 1) + 2)⁄3⌉. Let 𝑘 = ⌈(𝑛(𝑚 + 1) + 2)⁄3⌉. We construct a total 𝑘-labeling 𝛾: 𝑉(𝜃(𝑛; 𝑚)) ∪
𝐸(𝜃(𝑛; 𝑚)) → {1,2, ⋯ , 𝑘} as follows
𝛾(𝑐0 ) = 1,
𝑛(𝑚+1)+2
𝛾(𝑐1 ) = ⌈ 3
⌉,
𝑛(𝑗+1)+2 𝑛−1 𝑛−1
𝛾(𝑥𝑖,𝑗 ) = ⌈ ⌉ + ⌈ ⌉ − 𝑛, for 1 ≤ 𝑖 ≤ ⌈ ⌉ and 1 ≤ 𝑗 ≤ 𝑚,
3 3 3
𝑛(𝑗+1)+2 𝑛−1
𝛾(𝑥𝑖,𝑗 ) = ⌈ ⌉ + 𝑖 − 𝑛, for ⌈ ⌉+1 ≤ 𝑖 ≤ 𝑛 and 1 ≤ 𝑗 ≤ 𝑚,
3 3
𝛾(𝑐0 𝑥𝑖,1 ) = 𝑖 + 2 − 𝛾(𝑐0 ) − 𝛾(𝑥𝑖,1 ), for 1 ≤ 𝑖 ≤ 𝑛,
𝛾(𝑥𝑖,𝑚 𝑐1 ) = 𝑛𝑚 + 𝑖 + 2 − 𝛾(𝑥𝑖,𝑚 ) − 𝛽(𝑐1 ), for 1 ≤ 𝑖 ≤ 𝑛,
𝛾(𝑥𝑖,𝑗−1 𝑥𝑖,𝑗 ) = 𝑛(𝑗 − 1) + 𝑖 + 2 − 𝛾(𝑥𝑖,𝑗−1 ) − 𝛾(𝑥𝑖,𝑗 ), for 1 ≤ 𝑖 ≤ 𝑛 and 2 ≤ 𝑗 ≤ 𝑚.
By (1) we have each weight of edges as the following
𝑤𝑡𝛾 (𝑐0 𝑥𝑖,1 ) = 𝑖 + 2, for 1 ≤ 𝑖 ≤ 𝑛,
𝑤𝑡𝛾 (𝑥𝑖,𝑚 𝑐1 ) = 𝑛𝑚 + 𝑖 + 2, for 1 ≤ 𝑖 ≤ 𝑛,
𝑤𝑡𝛾 (𝑥𝑖,𝑗−1 𝑥𝑖,𝑗 ) = 𝑛(𝑗 − 1) + 𝑖 + 2, for 1 ≤ 𝑖 ≤ 𝑛 and 2 ≤ 𝑗 ≤ 𝑚.

4
ICRIEMS 5 IOP Publishing
IOP Conf. Series: Journal of Physics: Conf. Series 1097 (2018)
1234567890 ‘’“” 012069 doi:10.1088/1742-6596/1097/1/012069

It is clear that the weight of all edges are varying distinctively from 3 to 𝑛(𝑚 + 1) + 2. Hence, 𝛾 is an
irregular total 𝑘-labeling with 𝑘 = ⌈(𝑛(𝑚 + 1) + 2)⁄3⌉. Hence, we have 𝑡𝑒𝑠(𝜃(𝑛; 𝑚)) =
⌈(𝑛(𝑚 + 1) + 2)⁄3⌉. ∎
We know from the results above that the total edge irregularity strength of uniform theta graph is
precisely the same with what was given in (3). In other words, we support the conjecture .

3. Conclusion
We answered the open problem found from the work of Rajasingh and Arockiamary in [7] by proofing
that the total edge irregularity strength of uniform theta graph 𝜃(𝑛; 𝑚), 𝑛 ≥ 3, 𝑚 ≥ 1 is precisely what
was given in (3). Hereby we support the conjecture of Ivančo and Jendrol in [2] for uniform theta graphs.

References
[1] Wilson R J 1979 Introduction to graph theory Pearson Education India
[2] Ivančo J and Jendrol S 2006 Total edge irregularity strength of trees Discussiones Mathematicae
Graph Theory 26(3) 449
[3] Bača M, Miller M and Ryan J 2007 On irregular total labellings Discrete Mathematics 307 (11-
12) 1378
[4] Wallis W D 2012 Magic graphs Springer Science & Business Media
[5] Ahmad A, Arshad M, and Ižaríková G 2015 Irregular labelings of helm and sun graphs AKCE
International Journal of Graphs and Combinatorics 12(2-3) 161
[6] Hinding N, Suardi N and Basir H 2015 Total edge irregularity strength of subdivision of star
Journal of Discrete Mathematical Sciences and Cryptography 18(6) 869
[7] Rajasingh I and Arockiamary S T 2015 Total edge irregularity strength of series parallel graphs
International Journal of Pure and Applied Mathematics 99(1) 11
[8] Ahmad A, Ibrahim M and Siddiqui M K 2016 On the total irregularity strength of generalized
Petersen graph Math. Rep. (Bucur.) 18 (68) 197
[9] Massalesse J and Yulandary B B 2016 The total edge irregular labeling of network constructed by
some copies of cycle on three vertices corona a vertex Indian Journal of Science and
Technology 9(28)
[10] Siddiqui M K, Afzal D and Faisal M R 2017 Total edge irregularity strength of accordion graphs
Journal of Combinatorial Optimization 34(2) 534
[11] Putra R W and Susanti Y 2018 On total edge irregularity strength of centralized uniform theta
graphs AKCE International Journal of Graphs and Combinatorics 15 (1) 7