Journal of Physics: Conference

Series

PAPER • OPEN ACCESS You may also like

- (H1, H2)-supermagic labelings for some
The total H-irregularity strength of triangular ladder shackles of connected graphs H1 and H2
Yeva Fadhilah Ashari and A.N.M Salman
graphs - The total H-irregularity strength of
triangular ladder and grid graphs
R Nisviasari, Dafik and I H Agustin
To cite this article: R Nisviasari et al 2020 J. Phys.: Conf. Ser. 1465 012026
- The effect of Gd2BaCuO5 nanoparticles on
irreversibility fields of
(Nd–Sm–Gd)Ba2Cu3O7
Gunadhor S Okram, Miryala Muralidhar
and M Murakami
View the article online for updates and enhancements.

This content was downloaded from IP address 202.170.60.227 on 15/07/2024 at 14:33

ICOPAMBS 2019 IOP Publishing
Journal of Physics: Conference Series 1465 (2020) 012026 doi:10.1088/1742-6596/1465/1/012026

The total H-irregularity strength of triangular ladder

graphs
R Nisviasari1,2 , Dafik1,3 and I H Agustin1,2
1
CGANT-University of Jember, Indonesia
2
Department of Mathematics, University of Jember, Indonesia
3
Department of Postgraduate of Mathematics Education, University of Jember, Indonesia
E-mail: [email protected]

Abstract. Let G be a graph which has V (G) as a vertex set and E(G) as an edge set.
The G graph contain subgraph H that isomorphic with Hj , j = 1, 2, . . . s, if every e ∈ E(G)
include only in one of the edge set of H subgraph (e ∈ E(H)). The total l-labeling is a graph
labeling that give label positive integer number until l into vertices and edges. The total H-
irregular labeling is a total l-labeling with condition that the sum of vertex labels and edge
labels in two P
distinct subgraphsP H1 and H2 isomorphic to H is different. We define H-weight
as wtϕ (H) = v∈V (H) ϕ(v) + e∈E(H) ϕ(e), for the subgraph H ⊆ G under the total l-labeling
(ϕ). The total H-irregularity strength of G graph (ths(G, H)) is the smallest l value in label of
G graph has total H-irregular labeling. We used plane graphs such as triangular ladder graph
and windmill graph.

1. Introduction
We only used plane graphs in this paper, especially triangular ladder graph and windmill graph.
Let G be a graph which has V (G) as a vertex set and E(G) as an edge set. The G graph contain
subgraph H that isomorphic with Hj , j = 1, 2, . . . s, if every e ∈ E(G) include only in one of
the edge set of H subgraph (e ∈ E(H)) [1]. An assignment of integers to the elements of graph
such as vertices, edges, or vertices and edges with certain conditions is called a graph labeling
[2]. The type of graph labeling is total l-labeling. The total l-labeling is a graph labeling that
give label positive integer number until l into vertices and edges [3].
The total l-labeling has another type called irregular labeling. There are three type of
irregular labeling such as total vertex irregular labeling, total edge irregular labeling, and total
H irregular labeling. A total vertex irregular labeling is a total l-labeling with condition that the
sum of vertex label and edge labels in incident vertex is different [4]. There are many researcher
that found the total vertex irregular strengths for various classes of graphs. Susilawati et al. [5]
proved total vertex irregularity strength of trees with maximum degree five. Ahmad et al. [6]
obtain total vertex irregularity strength of ladder related graphs.
Another type of irregular labeling is a total edge irregular labeling. A total edge irregular
labeling is a total l-labeling with condition that the sum of vertex labels and edge label in
adjacent edge is different [7]. Putra and Susanti [8] investigate the total edge irregularity strength
of centralized uniform theta graphs. Siddiqui et al. [9] get total edge irregularity strength of
accordion graphs.

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
ICOPAMBS 2019 IOP Publishing
Journal of Physics: Conference Series 1465 (2020) 012026 doi:10.1088/1742-6596/1465/1/012026

The total H-irregular labeling is a total l-labeling with condition that the sum of vertex
labels and edge labels in two distinct subgraphs H1 and H2 isomorphic to H is different. We
define H-weight as X X
wtϕ (H) = ϕ(v) + ϕ(e),
v∈V (H) e∈E(H)

for the subgraph H ⊆ G under the total l-labeling (ϕ). The total H-irregularity strength of G
graph (ths(G, H)) is the smallest l value in label of G graph has total H-irregular labeling. We
used Theorem 1 as a lower bound of the strength of total H-irregularity.

Theorem 1 [1] Let G be a graph admitting an H-covering given by t subgraphs isomorphic to

H. Then & '
t−1
tHs(G, H) ≥ 1 + .
|V (H)| + |E(H)|

Agustin et al. [10] determine the total H-irregularity strength of operation graph such as
shackle and amalgamation graph. Nisviasari et al. [11] have found the total H-irregularity
strength of family graph, especially tHs(G(3, n, C4 )), tHs(T Ln , Cm ), and tHs(T Ln , F3 ).
We used plane graphs such as triangular ladder graph and windmill graph. [12] described
triangular ladder graph. Triangular ladder graph is constructed from a ladder (Lm ) by adding
the edges ui vi+1 for j integer number until m − 1.

2. Results
Some result of our research total H-irregularity strength of plane graphs is as follows.

Theorem 2 Let T Ln be a triangular ladder graph for n ≥ 3 admitting a H ≡ W d3,2 -covering.

Then & '
2n + 6
tHs(T Ln , W d3,2 ) = .
11

Proof. Let T Ln , n ≥ 3, be a triangular ladder graph with the vertex set V (T Ln ) = {xi , yi : i =
1, 2, 3, . . . , n} and the edge set E(T Ln ) = {xi xi+1 , yi yi+1 , xi yi+1 : i = 1, 2, 3, . . . , n − 1} ∪ {xi yi :
i = 1, 2, 3, . . . , n}. The triangular ladder graph T Ln , n ≥ 3, contains a W d3,2 -covering with
exactly 2n − 4 windmills W d3,2 . To get the lower l bound,m we must input the information l mabove
into Theorem 1. We get tHs(T Ln , W d3,2 ) ≥ 2n+6 11 as a lower bound. Put k = 2n+6
11 . We
shown l as an upper bound of the total W d3,2 -irregularity strength of T Ln , we define a W d3,2 -
irregular total l-labeling ϕW d3,2 : V (T Ln ) ∪ E(T Ln ) → {1, 2, . . . , k}.

A W d3,2 -irregular total l-labeling ϕW d3,2 : V (T Ln ) ∪ E(T Ln ) → {1, 2, . . . , l} is as follows:

for s = 1, 2, 3, . . .


 1, 1 ≤ i ≤ 3,
2, 4 ≤ i ≤ 9,

ϕW d3,2 (xi ) =

 2s + 1, 11s − 1 ≤ i ≤ 11s + 2,
2s + 2, 11s + 3 ≤ i ≤ 11s + 9,




 1, 1 ≤ i ≤ 3,
2, 4 ≤ i ≤ 9,



ϕW d3,2 (yi ) = 2s + 1, 11s − 1 ≤ i ≤ 11s + 4,
2s + 2, 11s + 5 ≤ i ≤ 11s + 8,




2s + 3, i = 11s + 9,


2
ICOPAMBS 2019 IOP Publishing
Journal of Physics: Conference Series 1465 (2020) 012026 doi:10.1088/1742-6596/1465/1/012026



 1, 1 ≤ i ≤ 6,
 2, 7 ≤ i ≤ 9,


ϕW d3,2 (xi yi ) = 2s, i = 11s − 1,
2s + 1, 11s ≤ i ≤ 11s + 6,




2s + 2, 11s + 7 ≤ i ≤ 11s + 9,



 1, 1 ≤ i ≤ 4,
 2, 5 ≤ i ≤ 9,


ϕW d3,2 (xi xi+1 ) = 2s, 11s − 1 ≤ i ≤ 11s,
2s + 1, i = 11s + 1,




2s + 2, 11s + 2 ≤ i ≤ 11s + 9,



 1, i = 1,
2, 2 ≤ i ≤ 7,




3, 8 ≤ i ≤ 9,

ϕW d3,2 (yi yi+1 ) =

 2s + 1, 11s − 1 ≤ i ≤ 11s + 6,
2s + 2, i = 11s + 7,




2s + 3, 11s + 8 ≤ i ≤ 11s + 9,



 1, 1 ≤ i ≤ 5,
 2, 6 ≤ i ≤ 9,


ϕW d3,2 (xi yi+1 ) = 2s, 11s − 1 ≤ i ≤ 11s,
2s + 1, 11s + 1 ≤ i ≤ 11s + 4,




2s + 2, 11s + 5 ≤ i ≤ 11s + 9,


We can see that every vertex and edge labels under ϕW d3,2 -labeling are almost l. We get the
W d3,2 -weight of W d3,2 j , j = 1, 2, . . . , 2n − 4, under the total labeling ϕW d3,2 , we get

wtϕW d3,2 (W dj3,2 ) =

X X
ϕW d3,2 (v) + ϕW d3,2 (e) (1)
v∈V (W dj3,2 ) e∈E(W dj3,2 )

From the wtϕW d3,2 (W d3,2 j ) that the sum of vertex and edge labels, we get increasing
sequences. And it is enough to prove that wtϕW d3,2 (W d3,2 j ) < wtϕW d3,2 (W d3,2 j+1 ), j =
1, 2, . . . , 2n − 5.
The function of vertex and edges label ϕW d3,2 is periodic function with s variable. For every
s is natural number, s = 1, 2, 3, . . . , function ϕW d3,2 used to give label for every vertex and edges
on T Ln graph for n ≡ 10 (mod 11) where n is natural number which n ≥ 21. Every weight on
W d3,2 covering:
w1 = ϕW d3,2 (xi ) + ϕW d3,2 (xi+1 ) + ϕW d3,2 (xi+2 ) + ϕW d3,2 (xi xi+1 ) + ϕW d3,2 (xi+1 xi+2 )
+ϕW d3,2 (yi+1 ) + ϕW d3,2 (yi+2 ) + ϕW d3,2 (xi yi+1 ) + ϕW d3,2 (xi+1 yi+2 )
+ϕW d3,2 (xi+1 yi+1 ) + ϕW d3,2 (xi+2 yi+2 )
w2 = ϕW d3,2 (xi ) + ϕW d3,2 (xi+1 ) + ϕW d3,2 (yi ) + ϕW d3,2 (yi+1 ) + ϕW d3,2 (yi+2 )
+ϕW d3,2 (yi yi+1 ) + ϕW d3,2 (yi+1 yi+2 ) + ϕW d3,2 (xi yi+1 ) + ϕW d3,2 (xi+1 yi+2 )
+ϕW d3,2 (xi yi ) + ϕW d3,2 (xi+1 yi+1 )
For every s, we got the weight of covering for n ≥ 21, n ≡ 10 (mod 11) is
w1 = 11, 13, 15, . . . , 2n + 5
w2 = 12, 14, 16, . . . , 2n + 6

3
ICOPAMBS 2019 IOP Publishing
Journal of Physics: Conference Series 1465 (2020) 012026 doi:10.1088/1742-6596/1465/1/012026

Hence,

wtϕW d3,2 = w1 + w2 = 11, 12, 13, 14, 15, 16, . . . , 2n + 5, 2n + 6

Based on (1), we get wtϕW d3,2 (W dj+1 j

3,2 ) = 1 + wtϕW d3,2 (W d3,2 ). Otherwise, the weight of
W d3,2 covering of T Ln has different weight which is aritmathic sequence with difference 1.
The weight of W d3,2 is wtϕW d3,2 (W dj3,2 ) =
P P
ϕ
v∈V (W dj ) W d3,2
(v) + e∈E(W dj ) ϕW d3,2 (e) =
3,2 3,2
{11, 12, 13, 14, . . . , 2n + 6}.
l m l m
2n+6 2n+6
Then tHs(T Ln , W d3,2 ) ≥ 11 and tHs(T Ln , W d3,2 ) ≤ 11 , tHs(T Ln , W d3,2 ) =
l m
2n+6
11 . 

Figure 1. The example of total W d3,2 -irregular labeling of triangular ladder graph

Theorem 3 Let T Ln be a triangular ladder graph for n ≥ 4 admitting a H ≡ T Lm -covering,

3 ≤ m < n. Then & '
n + 5m − 3
tHs(T Ln , T Lm ) = .
6m − 3

Proof. Let T Ln , n ≥ 3, be a triangular ladder with the vertex set V (T Ln ) = {xi , yi : i =

1, 2, 3, . . . , n} and the edge set E(T Ln ) = {xi xi+1 , yi yi+1 , xi yi+1 : i = 1, 2, 3, . . . , n − 1} ∪ {xi yi :
i = 1, 2, 3, . . . , n}. The triangular ladder T Ln , n ≥ 3, contains a T Lm -covering with exactly
n − m + 1 triangular ladder T Lm , 3 ≤ m < n.
To get the lower l bound, m we must input the information l above
m into 1. We get
n+5m−3 n+5m−3
tHs(T Ln , T Lm ) ≥ 6m−3 as a lower bound. Put k = 6m−3 . To show that l is an
upper bound for the total T Lm -irregularity strength of T Ln , we define a T Lm -irregular total
l-labeling ϕT Ln from vertex and edge labels to integer number until l.
A T L3 -irregular total l-labeling ϕT L3 from vertex and edge labels to integer number until l
is as follows:

for i = 1, 2, . . . , n,
& ' & '
i + 12 i+6
ϕT L3 (xi ) = , ϕT L3 (xi yi ) = ,
15 15
& '
i+9
ϕT L3 (yi ) = .
15

4
ICOPAMBS 2019 IOP Publishing
Journal of Physics: Conference Series 1465 (2020) 012026 doi:10.1088/1742-6596/1465/1/012026

for i = 1, 2, . . . , n − 1, & ' & '

i+4 i
ϕT L3 (xi xi+1 ) = , ϕT L3 (xi yi+1 ) = ,
15 15
& '
i+2
ϕT L3 (yi yi+1 ) = .
15

A T L4 -irregular total l-labeling ϕT L4 from vertex and edge labels to integer number until l
is as follows:
for i = 1, 2, . . . , n,
& ' & '
i + 17 i+9
ϕT L4 (xi ) = , ϕT L4 (xi yi ) = ,
21 21
& '
i + 13
ϕT L4 (yi ) = .
21

for i = 1, 2, . . . , n − 1, & ' & '

i+6 i
ϕT L4 (xi xi+1 ) = , ϕT L4 (xi yi+1 ) = ,
21 21
& '
i+3
ϕT L4 (yi yi+1 ) = .
21

A T L5 -irregular total l-labeling ϕT L5 from vertex and edge labels to integer number until l
is as follows:
for i = 1, 2, . . . , n,
& ' & '
i + 22 i + 12
ϕT L5 (xi ) = , ϕT L5 (xi yi ) = ,
27 27
& '
i + 17
ϕT L5 (yi ) = .
27

for i = 1, 2, . . . , n − 1, & ' & '

i+8 i
ϕT L5 (xi xi+1 ) = , ϕT L5 (xi yi+1 ) = ,
27 27
& '
i+4
ϕT L5 (yi yi+1 ) = .
27

If we continue the function of vertex and edge labels, then we get general function of vertex
and edge labels for ϕT Lm . A T Lm -irregular total l-labeling ϕT Lm from vertex and edge labels
to integer number until l is as follows:
for i = 1, 2, . . . , n,
& ' & '
i + 5m − 3 i + 3m − 3
ϕT Lm (xi ) = , ϕT Lm (xi yi ) = ,
6m − 3 6m − 3
& '
i + 4m − 3
ϕT Lm (yi ) = .
6m − 3

5
ICOPAMBS 2019 IOP Publishing
Journal of Physics: Conference Series 1465 (2020) 012026 doi:10.1088/1742-6596/1465/1/012026

for i = 1, 2, . . . , n − 1,
& ' & '
i + 2m − 2 i
ϕT Lm (xi xi+1 ) = , ϕT Lm (xi yi+1 ) = ,
6m − 3 6m − 3
& '
i+m−1
ϕT Lm (yi yi+1 ) = .
6m − 3

We can see that every vertex and edge labels under ϕT Lm -labeling and ϕT Lm -labeling are
almost l. We get the ϕT Lm -weight of T Ljm , j = 1, 2, . . . , n − m + 1, under the total labeling
T Lm , 3 ≤ m < n, we get
X X
wtϕT Lm (T Ljm ) = ϕ( v) + ϕ( e) (2)
v∈V (T Ljm ) e∈E(T Ljm )

From the wtϕT Lm (T Ljm ) that the sum of vertex and edge labels, we get increasing sequences.
We can prove increase sequences with wtϕT Lm (T Lj+1 j
m ) − wtϕT Lm (T Lm ) = 1, 3 ≤ m < n and
j = 1, 2, . . . , n − m.
For every j = 1, 2, . . . , n − m, we have
wtϕm (T Lj+1 j
m ) − wtϕm (T Lm ) = ϕT Lm (xj+m ) + ϕT Lm (yj+m ) + ϕT Lm (xj+m yj+m )
+ϕT Lm (xj+m−1 xj+m ) + ϕT Lm (yj+m−1 yj+m )
+ϕT Lm (xj+m−1 yj+m ) − ϕT Lm (xj ) − ϕT Lm (yj )
−ϕT Lm (xj yj ) − ϕT Lm (xj xj+1 ) − ϕT Lm (yj yj+1 )
−ϕT Lm (xj yj+1 )
& ' & '
j + m + 5m − 3 j + m + 4m − 3
= +
6m − 3 6m − 3
& ' & '
j + m + 3m − 3 j + m − 1 + 2m − 2
+ +
6m − 3 6m − 3
& ' & '
j+m−1+m−1 j+m−1
+ +
6m − 3 6m − 3
& ' & ' & '
j + 5m − 3 j + 4m − 3 j + 3m − 3
− − −
6m − 3 6m − 3 6m − 3
& ' & ' & '
j + 2m − 2 j+m−1 j
− − −
6m − 3 6m − 3 6m − 3
& ' & '
j + 6m − 3 j
= −
6m − 3 6m − 3
& ' & ' & '
j 6m − 3 j
= + −
6m − 3 6m − 3 6m − 3
wtϕm (T Lj+1 j
m ) − wtϕm (T Lm ) = 1

We get that every weight T Lm covering of T Ln graph, n ≥ 3 is different which is

arithmathics
P with different 1. The total weight of T Lm covering is wtϕT Lm (T Ljm ) =
sequence P
ϕ
v∈V (T Ljm ) T Lm
(v) + e∈E(T Ljm ) ϕ4 (e) = {6m − 3, 6m − 2, 6m − 1, . . . , n + 5m − 3}. Otherwise,
l m
we take the largest label function, ϕT Lm (xi ) = i+5m−3
6m−3 ; 1 ≤ i ≤ n for i = n, then we get,

6
ICOPAMBS 2019 IOP Publishing
Journal of Physics: Conference Series 1465 (2020) 012026 doi:10.1088/1742-6596/1465/1/012026

& '
i + 5m − 3
tHs(T Ln ) ≤
6m − 3
& '
n + 5m − 3
=
6m − 3
l m l m
n+5m−3 n+5m−3
Hence, tHs(T Ln , T Lm ) ≥ 6m−3 and tHs(T Ln , T Lm ) ≤ 6m−3 , tHs(T Ln , T Lm ) =
l m
n+5m−3
6m−3 . 

Figure 2. The Illustration of Total (a) T L3 -Irregularity of T L8 (b) T L7 -Irregularity of T L8

The result of this research contain two theorem that both of theorems reach the lower bound
as 1. We can see the proof of theorem has been proved by the lower bound and the upper bound.
We also give the example and illustration of the total H-irregular labeling.

3. Conclusion
We have given the result of total H-irregularity strength of triangular ladder graphs which
admitting H equivalent to windmill graph and triangular ladder graph. We give suggestion for
further researcher to find the total H-irregularity strength of related tree graphs.

Acknowledgment
We are thankful for amazing support from CGANT-University of Jember in 2019.

References
[1] F Ashraf, M Bača, M Lascsáková and A Semaničová-Feňovčíková 2017 On H-irregularity strength of graphs
Discussiones Mathematicae: Graph Theory 37 pp 1067-1078
[2] J A Gallian 2017 A dynamic survey of graph labeling The Electronic Journal of Combinatorics 20 pp 1-432
[3] Slamin, Dafik, and W Winona 2011 Total vertex irregularity strength of the disjoint union of sum graphs The
Electronic Journal of Combinatorics 2012 pp 1-9
[4] A Ahmad and M Bac̆a 2013 On vertex irregular total labelings Ars Combinatoria 112 pp 129-139

7
ICOPAMBS 2019 IOP Publishing
Journal of Physics: Conference Series 1465 (2020) 012026 doi:10.1088/1742-6596/1465/1/012026

[5] S Susilawati, E T Baskoro, and R Simanjuntak 2018 Total vertex irregularity strength of trees with maximum
degree five Electronic Journal of Graph Theory and Application 6(2) pp 250-257
[6] A Ahmad, S A Bokhary, R Hasni, and Slamin 2014 Total vertex irregularity strength of ladder related graphs
International Referred Research Journal 26(1) pp 1-5
[7] I Tarawneh, R Hasni, and A Ahmad 2016 On the edge irregularity strength of corona product of cycle with
isolated vertices AKCE International Journal of Graphs and Combinatorics 13 pp 213-217
[8] R W Putra and Y Susanti 2018 On total edge irregularity strength of centralized uniform theta graphs AKCE
International Journal of Graphs and Combinatorics 15(1) pp 7-13
[9] M K Siddiqui, D Afzal, and M R Faisal 2017 Total edge irregularity strength of accordion graphs Journal of
Combinatorial Optimization 34 pp 534-544
[10] I H Agustin, Dafik, Marsidi, and E R Albirri 2017 On the total H-irregularity strength of graphs: a new
notion Journal of Physics: Conf. Series 855 pp 1-9
[11] R Nisviasari, Dafik, and I H Agustin 2019 The total H-irregularity strength of triangular ladder and grid
graphs Journal of Physics: Conference Series 1211 pp 1-8
[12] M A Seoud, M El-Zekey, and E F El-Gazar 2017 Mean, odd sequential and triangular sum graphs Circulation
in Computer Science 2(4) pp 40-52