Edge irregular reflexive labeling on tadpole

graphs Tm,1 and Tm,2

Cite as: AIP Conference Proceedings 2326, 020006 (2021); https://doi.org/10.1063/5.0039337
Published Online: 08 February 2021

Nadia Indarwati Setia Budi, Diari Indriati and Bowo Winarno

ARTICLES YOU MAY BE INTERESTED IN

Edge irregular reflexive labeling on umbrella graphs U3,n and U4,n

AIP Conference Proceedings 2326, 020021 (2021); https://doi.org/10.1063/5.0039336

Edge irregular reflexive labeling on banana tree graphs B2,n and B3,n
AIP Conference Proceedings 2326, 020016 (2021); https://doi.org/10.1063/5.0039316

Super (a,d)-H-antimagic total labeling of generalized fan corona product with path and
generalized fan corona product with cycle
AIP Conference Proceedings 2326, 020003 (2021); https://doi.org/10.1063/5.0040078

AIP Conference Proceedings 2326, 020006 (2021); https://doi.org/10.1063/5.0039337 2326, 020006

© 2021 Author(s).
 Edge Irregular Reflexive Labeling on Tadpole Graphs
Tm,1 and Tm,2
Nadia Indarwati Setia Budi,a) Diari Indriati,b) and Bowo Winarnoc)
Department of Mathematics, Faculty of Mathematics and Natural Sciences, Universitas Sebelas Maret, Surakarta, Indonesia.
a) Corresponding author: [email protected]
b)
[email protected]
b) [email protected]
Abstract. Let G be a connected graph with vertex set V (G) and egde set E(G). An edge irregular reflexive k-labeling is a
function fe : E(G) → {1, 2, . . . , ke } and a function fv : V (G) → {0, 2, . . . , 2kv }, where k = max{ke , 2kv } of a graph G such that
the weights for all edge are distinct. Under f labeling for edges and vertices, the weight of edge xy in G, denoted by wt(xy) is
defined as wt(xy) = f (x) + f (xy) + f (y). The minimum k for which the graph G has an edge irregular reflexive k-labeling is called
the reflexive edge strength, denoted by res(G). In this paper, we investigate the reflexive edge strength of tadpole graph Tm,n with
m ≥ 3 and n = 1, 2.

Keywords: edge irregular reflexive, reflexive edge strength, pan graph, tadpole graph.

INTRODUCTION

Let G(V, E) be a connected, simple, and undirected graph with a set of vertices V (G) and edges E(G). A labeling of
a graph G is a mapping of graph elements into positive or non-negative integers, (Wallis [1]). There are several types
of graph labeling that can be classified into vertex labeling, edge labeling, and total labeling (vertex and edge). Bača
et al. [2] defined a total k-labeling, a vertex irregular total k-labeling and an edge irregular total k-labeling.
Bača et al. [2], defined an edge irregular total k-labeling is equivalent to total k-labeling if all edges have different
weights. The weight of edge e = xy in G, denoted by wt(e), is the sum of the labels of vertex x, vertex y and the label
of the edge e. The minimum k for which the graph G has an edge irregular reflexive k-labeling is called the reflexive
edge strength, denoted by res(G).
An edge irregular reflexive k-labeling is defined as the function fe : E(G) → {1, 2, . . . , ke } and fv : V (G) →
{0, 2, . . . , 2kv }, where k = max{ke , 2kv }. The following Lemma proven by Ryan et al. [3].
Lemma 1. For every graph G,
(
⌈ |E(G)|
3 ⌉, if |E(G)| 6≡ 2, 3 (mod 6),
res(G) ≥ |E(G)|
⌈ 3 ⌉ + 1, if |E(G)| ≡ 2, 3 (mod 6).
Many researchers have investigated res(G) to some graph classes. In 2017, Bača et al. [3], determined the res(G)
of generalized friendship graph. Tanna et al. [4] proved res(G) of prisms, fans, wheels, and baskets graph, that
are res(Dn ) = n + 1if n is odd and n if n is even, res(Fn ) = res(Bn ) = 3 if n = 3, 4 if n = 4, and ⌈ 2n
3 ⌉if n ≥ 5, and
res(Wn ) = 4 if n = 3, ⌈ 2n
3 ⌉ if n ≡ 0, 2 (mod 3) and n ≥ 5, and ⌈ 2n
3 ⌉ + 1 if n ≡ 1 (mod 3).
In 2018, Zhang et al. [5] determined for the disjoint union of gear graphs and prims graph. Guirao et al. [6]
determined for disjoint union of generelized petersen graph. In 2019, Bača et al. [7] have established for cycles,
cartesian product of two cycles and join graphs of path graph and cycle graph with 2K2 .
Furthermore, in 2020, Indriati et al. [8], investigation on corona of path and complete graph K1 , also corona of path
and path graph P2 . Agustin et al. [9] determined for family trees, namely generalized sub-divided star graph, broom
graph, and double star graph(res(DSn,m ) for n ≥ m and m ≥ 2). Then Ibrahim et al. [10] determine the exact value
for the star, double star (res(Sn,n ) for n ≥ 4) and caterpillar graphs. In this paper, we investigate the reflexive edge
strength of tadpole graph Tm,n with m ≥ 3 and n = 1, 2.

MAIN RESULT

The tadpole graph Tm,n consist of a cycle of length m and a path of length n attached to one vertex of a cycle (Wallis
et al. [11]). An m-pan graph same as (m, 1)-tadpole graph (Koh, et al. [12] call these tadpole, Kim and Park
The Third International Conference on Mathematics
AIP Conf. Proc. 2326, 020006-1–020006-5; https://doi.org/10.1063/5.0039337
Published by AIP Publishing. 978-0-7354-4070-8/$30.00

020006-1
[13] call these kites, and Truszczyński, M [14] call these dragon). Let the vertex set of Tm,n be V (Tm,n ) = {xi :
1 ≤ i ≤ ⌈ m2 ⌉} ∪ {y1 } ∪ {xm−(i−1) : m ≥ 3, 1 ≤ i ≤ ⌊ m2 ⌋} and the edge set of Tm,n be E(Tm,n ) = {y1 x1 } ∪ {x1 xm : m ≥
3} ∪ {xi x(i+1) : 1 ≤ i ≤ ⌈ m2 ⌉} ∪ {xm−(i−1) xm−i : m ≥ 3, 1 ≤ i ≤ ⌊ m2 ⌋ − 1}.
As a result tadpole graph Tm,n has m + n vertices and m + n edges. The reflexive edge strength of tadpole graph Tm,1
can be got through Theorem 1, and the reflexive edge strength of tadpole graph Tm,2 can be got through Theorem 2.

Theorem 1. For every positive integer m, m ≥ 3,

(
⌈ m+1
3 ⌉, if m 6≡ 1, 2 (mod 6),
res(Tm,1 ) =
⌈ m+1
3 ⌉ + 1, if m ≡ 1, 2 (mod 6).

Proof. First, we prove the lower bound of reflexive edge strength Tm,1 . Because tadpole graph Tm,1 has m + 1 edges,
then by Lemma 1, we get :

(
⌈ m+1
3 ⌉, if (m + 1) 6≡ 2, 3 (mod 6),
res(G) ≥ k =
⌈ m+1
3 ⌉ + 1, if (m + 1) ≡ 2, 3 (mod 6).

So, it is equivalent with the following statement :

(
⌈ m+1
3 ⌉, if m 6≡ 1, 2 (mod 6),
res(Tm,1 ) ≥ k = m+1
⌈ 3 ⌉ + 1, if m ≡ 1, 2 (mod 6).

Furthermore, we will prove the upper bound for the edge irregular reflexive k-labeling of Tm,1 . Construct k-labeling µ
with k1 = ⌈ m+1 m+1
3 ⌉ if m 6≡ 1, 2 (mod 6) and k2 = ⌈ 3 ⌉ + 1 if m ≡ 1, 2 (mod 6) as follows,

µ(y1 ) = 0.
µ(y1 x1 ) = 1.
µ(x1 xm ) = 1, m ≥ 3.
(
0, if 1 ≤ i ≤ 2,
µ(xi ) =
2⌈ i−1
3 ⌉, if 3 ≤ i ≤ ⌈ m2 ⌉.
(
2, if 1 ≤ i ≤ 2,
µ(xi x(i+1) ) =
2⌊ 3 ⌋, if 3 ≤ i ≤ ⌈ m2 ⌉.
i

For m ≡ 0 (mod 6).

(
2⌊ i+3 m
3 ⌋, if 1 ≤ i ≤ ⌊ 2 ⌋ − 1,
µ(xm−(i−1) ) = 2i m
3, if i = ⌊ 2 ⌋.
(
2⌊ i−1 m
3 ⌋ + 1, if 1 ≤ i ≤ ⌊ 2 ⌋ − 2,
µ(xm−(i−1) xm−i ) = 2i+5
3 , if i = ⌊ m2 ⌋ − 1.

For m 6≡ 0 (mod 6).

n
µ(xm−(i−1) ) = 2⌊ i+3 m
3 ⌋, if 1 ≤ i ≤ ⌊ 2 ⌋.

n
µ(xm−(i−1) xm−i ) = 2⌊ i−1 m
3 ⌋ + 1, if 1 ≤ i ≤ ⌊ 2 ⌋ − 1.

020006-2
From the proof of lower and upper bound, we know that the label of vertices is even. Next, we get the observation of
the edges weights as follows:
wt(y1 x1 ) = 1,
wt(x1 xm ) = 3, f or m ≥ 3,
m
wt(xi xi+1 ) = 2i,f or 1 ≤ i ≤ ⌈ ⌉,
2
m
wt(xm−(i−1) xm−i ) = 2i + 3, f or 1 ≤ i ≤ ⌊ ⌋ − 1.
2
Based on the observation above, it can be seen that the weights of edges of tadpole graph Tm,1 have different weight.
Therefore, µ has required element on an edge irregular reflexive k-labeling, then we have reflexive edges strength as
in Theorem 1. This completes the proof.
We give the illustration of an edge irregular reflexive 4-labeling of T8,1 in Figure 1. The black color is label and
name of vertices, and red color is edge weight.

FIGURE 1. An edge irregular reflexive 4-labeling of T8,1 .

Theorem 2. For every positive integer m, m ≥ 3,

(
⌈ m+2
3 ⌉, if m 6≡ 0, 1 (mod 6),
res(Tm,2 ) =
⌈ m+2
3 ⌉ + 1, if m ≡ 0, 1 (mod 6).

Proof. First, we prove the lower bound of reflexive edge strength Tm,2 . Because tadpole graph Tm,2 has m + 2 edges,
then by Lemma 1, we get :

(
⌈ m+2
3 ⌉, if (m + 2) 6≡ 2, 3 (mod 6),
res(G) ≥ k =
⌈ m+2
3 ⌉ + 1, if (m + 2) ≡ 2, 3 (mod 6).

So, it is equivalent with the following statement :

(
⌈ m+2
3 ⌉, if m 6≡ 0, 1 (mod 6),
res(Tm,2 ) ≥ k = m+2
⌈ 3 ⌉ + 1, if m ≡ 0, 1 (mod 6).

Furthermore, we will prove the upper bound for the edge irregular reflexive k-labeling of Tm,2 . Construct k-labeling µ
with k1 = ⌈ m+2 m+2
3 ⌉ if m 6≡ 0, 1 (mod 6) and k2 = ⌈ 3 ⌉ + 1 if m ≡ 0, 1 (mod 6) as follows,

µ(yi ) = 0, 1 ≤ i ≤ 2.
µ(y1 y2 ) = 1.
µ(y2 x1 ) = 2.
µ(x1 xm ) = 2, m ≥ 3.

020006-3
 (
0, if i = 1,
µ(xi ) =
2⌈ 3 ⌉, if 2 ≤ i ≤ ⌈ m2 ⌉.
i

µ(xm−(i−1) ) = 2⌊ 3i ⌋ + 2, if 1 ≤ i ≤ ⌊ m2 ⌋.

µ(xm−(i−1) xm−i ) = 2⌊ i−1 m

3 ⌋ + 2, if 1 ≤ i ≤ ⌊ 2 ⌋ − 1.

For m ≡ 5 (mod 6).


1,
 if i = 1,
µ(xi x(i+1) ) = 2⌊ 3 ⌋ − 1, if 2 ≤ i ≤ ⌈ m2 ⌉ − 1,
i+1
 2i + 1,

if i = ⌈ m2 ⌉.
3

For m 6≡ 5 (mod 6).

(
1, if i = 1,
µ(xi x(i+1) ) =
2⌊ i+1
3 ⌋ − 1, if 2 ≤ i ≤ ⌈ m2 ⌉.

From the proof of lower and upper bound, we know that the label of vertices is even. Next, we get the observation of
the edges weights as follows:

wt(y1 y2 ) = 1,
wt(y2 x1 ) = 2,
wt(x1 xm ) = 4, f or m ≥ 3,
m
wt(xi xi+1 ) = 2i + 1, f or 1 ≤ i ≤ ⌈ ⌉,
2
m
wt(xm−(i−1) xm−i ) = 2i + 4, f or 1 ≤ i ≤ ⌊ ⌋ − 1.
2
Based on the observation above, it can be seen that the weights of edges of tadpole graph Tm,2 have different weight.
Therefore, µ has required element on an edge irregular reflexive k-labeling, then we have reflexive edges strength as
in Theorem 2. This completes the proof.

We give the illustration of an edge irregular reflexive 4-labeling of T9,2 in Figure 2. The black color is label and
name of vertices, and red color is edge weight.

FIGURE 2. An edge irregular reflexive 4-labeling of T9,2

020006-4
 CONCLUSION

In this paper, we conclude that the reflexive edge strength of res(m − pan) or res(Tm,1 ) is ⌈ m+1
3 ⌉ for m 6≡ 1, 2 (mod 6)
and ⌈ 3 ⌉ + 1 for m ≡ 1, 2 (mod 6), while res(Tm,2 ) is ⌈ 3 ⌉ for m 6≡ 0, 1 (mod 6) and ⌈ m+2
m+1 m+2
3 ⌋ + 1 for m ≡ 0, 1
(mod 6). Furthermore, we have the open problem for the direction of next research, which are still in progress.

Open Problem : Determine the reflexive edge strength of tadpole graph Tm,n for m ≥ 3, n > 2.

ACKNOWLEDGMENTS

We gratefully acknowledge the support from Departement of Mathematics, Faculty of Mathematics and Natural
Sciences, Universitas Sebelas Maret. We also deliver our thank to the research advisor for their valuable suggestions
and references, which helped to improve the paper.

REFERENCES
1. W. D. Wallis, Magic Graphs (Boston: Birkhauser, 2001).
2. M. Bača, S. Jendrol, M. Miller, and J. Ryan, “On Irregular Total Labelings,” Discrete Math 307, 1378–1388 (2007).
3. M. Bača, M. Irfan, J. Ryan, A. Semaničová-Feňovčíková, and D. Tanna, “On Edge Irregular Reflexive Labellings for the Generalized Friend-
ship Graphs,” Mathematics 67, 1–11 (2017).
4. D. Tanna, J. Ryan, and A. Semanic̆ová-Fen̆ovc̆ıková, “Edge Irregular Reflexive Labeling of Prisms and Wheels,” Australasian Journal of
Combinatorics 69, (3):394–401 (2017).
5. X. Zhang, M. Ibrahim, M. K. Siddiqui, et al., “Edge irregular reflexive labeling for the disjoint union of gear graphs and prism graphs,”
Mathematics 6, 142 (2018).
6. J. L. Guirao, S. Ahmad, M. K. Siddiqui, and M. Ibrahim, “Edge irregular reflexive labeling for disjoint union of generalized petersen graph,”
Mathematics 6, 304 (2018).
7. M. Bača, M. Irfan, J. Ryan, A. Semaničová-Feňovčíková, and D. Tanna, “Note on edge irregular reflexive labelings of graphs,” AKCE
International journal of Graph and Combinatorics 16, 145–157 (2019).
8. D. Indriati, Widodo, and I. Rosyida, “Edge irregular reflexive labeling on corona of path and other graphs,” JPhCS 1489, 012004 (2020).
9. I. H. Agustin, D. Imam Utoyo, and M. Venkatachalam, “Edge irregular reflexive labeling of some tree graphs,” in Journal of Physics:
Conference Series, Vol. 1543 (2020) p. 012008.
10. M. Ibrahim, S. Majeed, and M. K. Siddiqui, “Edge irregular reflexive labeling for star, double star and caterpillar graphs,” TWMS Journal of
Applied and Engineering Mathematics 10, 718 (2020).
11. W. D. Wallis, E. T. Baskoro, M. Miller, and Slamin, “Edge-magic total labelings,” Australasian Journal of Combinatorics 22, 177–190 (2000).
12. K. M. Koh, Rogers D. G., Teo H. K., and Yap K. Y., “Graceful graphs: some further results and problems,” Congr. Numer. 29, 559–571 (1980).
13. S.-R. Kim, and J. Y. Park, “On super edge-magic graphs,” Ars Combin 81, 113–127 (2006).
14. M. Truszczyński, “Graceful Unicyclic Graphs,” Demonstatio Math 17, 377–387 (1984).

020006-5