Even vertex odd mean labeling of

uniform theta graphs

M. Basher
Department of Mathematics and Computer Science,
Faculty of Science, Suez University, Suez 43533, Egypt
E-mail: m_e_basher@yahoo.com

Abstract
Let G ∪
be a graph with p vertices and q edges. A total graph labeling
f : V (G) E(G) → {0, 1, 2, 3, ..., 2q} is called even vertex odd mean
labeling of a graph G if the vertices of the graph G label by distinct
even integers from the set {0, 2, ..., 2q} and the labels of the edges are
defined as the mean of the labels of its end vertices and these labels
are 2q − 1 distinct odd integers from the set {1, 3, 5, ..., 2q − 1}. In this
paper we investigate the even vertex odd mean labeling of uniform theta
graphs.

Mathematics Subject Classification: 05C78

Keywords: Labeling, Even vertex odd mean labeling, Even vertex odd
mean graphs, Uniform theta graphs.

1 Introduction
Let G = (V, E) be a simple, connected and undirected graph with vertex
set VG and edge set EG . The notions and terminology that exist in this paper
can be found in Harary [5]. In [8] Rajan et al. defined a generalized theta
graph θ(m1 , m2 , ..., mn ) is the graph that is obtained by taking two different
isolated vertices u and v (called the end vertices of θ) and attaching them by
n internal disjoint paths of length greater than one, where mi , 1 ≤ i ≤ n
denote the order of internal vertices of ith path. The two isolated vertices u
and v are called north pole (N ) and south pole (S) respectively. A generalized
theta graph is called uniform theta graph if all internal disjoint paths have the
same order i.e. mi = m for all 1 ≤ i ≤ n. A uniform theta graph with n
internal disjoint paths, all have the same order m is denoted by θ(n; m). In
Figure 1 we show the representation of θ(3; 5). R. Vasuki et al. defined the
even vertex odd mean labeling on graph G = (V, E) as an injective f from
V (G) to {0, 2, ..., 2q} such that each edge uv is assigned the label f (u)+f
2
(v)
the
resulting edge labels are {1, 3, 5, ..., 2q − 1} [9]. A graph that admits an even
vertex odd mean labeling is said to be an even vertex odd mean graph [1, 2,
3, 6, 7, 10]. See [4] for more an extensive survey of various graph labeling.
2 M. Basher

u11 u12 u13 u14 u15

u v
(N) u 21 u 22 u 23 u 24 u 25 (S)

u 31 u 32 u 33 u 34 u 35

Figure 1: uniform theta graph θ(3; 5)

2 Main results
Theorem 1. If n is odd and m ≥ 2, then θ(n; m) is an even vertex odd mean
graph.

Proof. Let G = θ(n; m) be a uniform theta graph. Let u, v be the pair of end
vertices of degree n and uij (1 ≤ i ≤ n,1 ≤ j ≤ m ) be the internal vertices of
n copies of path p(m+2) . Then |V (G)| = mn + 2 and |E(G)| = mn + n. Define
a bijective function f : V (G) → {0, 2, 4, ..., 2q = 2mn + 2n} as follows, label
the end vertices u and v by 2mn + 2n and 0 respectively.
Case(i). When m is odd.
Let Pmi denote the ith internal path of θ(n; m), hence the vertices Pm1 and Pm2
are labeled as follows:
{
2n(m − j) + 4n − 2, 1 ≤ j ≤ m and j is odd
f (u1j ) =
2n(m − j) − 2n + 4, 1 ≤ j ≤ m and j is even

{
2n(m − j) + 4n − 6, 1 ≤ j ≤ m and j is odd
f (u2j ) =
2n(m − j) − 2n + 12, 1 ≤ j ≤ m and j is even

Now if the vertices of the internal path Pmi−2 are labeled by f , hence the vertices
of the internal path Pmi are labeled as follows:
{
f (u(i−2)j ) − 8, 3 ≤ i ≤ n and i is odd
f (uij ) =
f (u(i−2)j ) + 16, 3 ≤ i ≤ n and i is even

Clearly, the label of edges can be obtained as:

Let Eu and Ev be the set of edges joining between the end points of n disjoint
paths and the two isolated vertices u and v respectively. Then we denote the
set of edge labels of Eu and Ev by f ∗ (Eu ) , f ∗ (Ev ) respectively. Thus, it is
observed that:
Even vertex odd mean labeling of uniform theta graphs 3

For 1 ≤ i ≤ n
f ∗ (Eu ) = 2n(m + 1) − 2i + 1,
f ∗ (Ev ) = 2n − 2i + 1.
Also let E(Pmi ) be the set of all edges of the ith internal path of θ(n; m). we
denote the set of edge labels of E(Pmi ) by f ∗ (E(Pmi )). So it is easy to see that:
For 1 ≤ j ≤ m − 1
f ∗ (E(Pm1 )) = 2nm − 2nj + 1,
f ∗ (E(Pm2 )) = 2nm − 2nj + 3.
It follows that the edge labels of E(Pmi ) are given by:
{ ∗
∗ i f (E(Pm1 )) + 2i − 2, 3 ≤ i ≤ n and i is odd
f (E(Pm )) =
f ∗ (E(Pm2 )) + 2i − 4, 3 ≤ i ≤ n and i is even
Hence, f is an even vertex odd mean labeling of θ(n; m).
Case(ii). When m is even.
Here the vertices of 1st and ( n+3
2
)th internal paths label as follows:
{
2n(m − j) + 4n − 2, 1 ≤ j ≤ m and j is odd
f (u1j ) =
2n(m − j) + 2n, 1 ≤ j ≤ m and j is even
{
2n(m − j) + 2n − 4, 1 ≤ j ≤ m and j is odd
f (u( n+3 )j ) =
2 2n(m − j) + 4n − 2, 1 ≤ j ≤ m and j is even
Also the remaining vertices of other internal paths label as follows:
{
f (u1j ) − 4i + 4, 2 ≤ i ≤ n+12
f (uij ) =
f (u( n+3 )j ) − 4i + 2n + 6, n+3
2
≤ i ≤ n.
2

Therefore, we can compute the label of the edges as follows.

f ∗ (Eu ) = {2n(m + 1) − 2i + 1, 1 ≤ i ≤ n}
n+1 n+3
f ∗ (Ev ) = {n − 2i + 2, 1 ≤ i ≤ } ∪ {3n − 2i + 2, ≤ i ≤ n}
2 2
( n+3 )
Also the set of edge labels of E(Pm1 ) and E(Pm 2
) are given as follows:
f ∗ (E(Pm1 )) = 2n(m − j) + 2n − 1, 1≤j ≤m−1
( n+3 )
f ∗ (E(Pm 2
)) = 2n(m − j) + 2n − 3, 1 ≤ j ≤ m − 1.
Obviously, the edge labels of E(Pmi ) are given by:
{
f ∗ (E(Pm1 )) − 4i + 4, 2≤i≤ n+1
f ∗ (E(Pmi )) = ( n+3 )
2
f ∗ (E(Pm 2 )) − 4i + 2n + 6, n+5
2
≤ i ≤ n.
Hence, f is an even vertex odd mean labeling of θ(n; m).
4 M. Basher

Example 2.1. The even vertex odd mean labeling f of θ(7; 5) and θ(9; 6)
are given in Figure 2 and Figure 3 respectively.

82 32 54 4 26

78 40 50 12 22

74 48 46 20 18

70 56 42 28 14
84 0
66 64 38 36 10

62 72 34 44 6

58 80 30 52 2

Figure 2: an even vertex odd mean labeling of θ(7; 5)

Theorem 2. If n is even and m is odd or n = 4 and m is even, then θ(n; m)

is an even vertex odd mean graph.

Proof. Consider G = θ(n; m) is a uniform theta graph where n is even and

m ≥ 1. Then we can define a bijective function f : V (G) → {0, 2, 4, ..., 2q =
2mn + 2n} as follows, label the end vertices u and v by 2mn + 2(n − m) + 2
and 0 respectively.
Case(i). When n is even and m is odd.
In this case the vertices of the internal paths uij (1 ≤ i ≤ n, 1 ≤ j ≤ m) label
as the following, first we label the vertices of the paths Pm1 , Pm2 by:
{
2mn + 2(n − m) + 2j − 2, 1 ≤ j ≤ m and j is odd
f (u1j ) =
2mn + 2(n − m) + 2j + 2, 1 ≤ j ≤ m and j is even

{
2mn + 2(n − m) − 2j − 2, 1 ≤ j ≤ m and j is odd
f (u2j ) =
2mn + 2(n − m) − 2j + 2, 1 ≤ j ≤ m and j is even

Now, for 1 ≤ i ≤ n2 and n2 + 3 ≤ i ≤ n if the vertices of the path Pmi−2 are

labeled, then the vertices of the path Pmi are labeled as follows:

f (uij ) = f (u(i−2)j ) − 4m − 4.
Even vertex odd mean labeling of uniform theta graphs 5

124 90 88 54 52 18

120 86 84 50 48 14

116 82 80 46 44 10

112 78 76 42 40 6

108 74 72 38 36 2
126 0
104 106 68 70 32 34

100 102 64 66 28 30

96 98 60 62 24 26

92 94 56 58 20 22

Figure 3: an even vertex odd mean labeling of θ(9; 6)

n n
+1 +2
Also for i = n2 + 1, n2 + 2 the vertices of the internal two paths Pm2 and Pm2
are labeled as follows:
{
f (u(i−2)j ) − 4m − 4, 1 ≤ j ≤ m and j is odd
f (uij ) =
f (u(i−2)j ) − 4m − 8, 1 ≤ j ≤ m and j is even.

According to Theorem 1. we can compute the label of edges as follows:

{
∗ (m + 1)(2n − i) − m + 2, 1 ≤ i ≤ n and i is odd
f (Eu ) =
(m + 1)(2n − i) + 1, 1 ≤ i ≤ n and i is even.

{
∗ (m + 1)(n − i) + m, 1 ≤ i ≤ n and i is odd
f (Ev ) =
(m + 1)(n − i) + 1, 1 ≤ i ≤ n and i is even.

f ∗ (E(Pm1 )) = 2nm + 2(n − m) + 2j + 1, 1≤j ≤n−1

f ∗ (E(Pm2 )) = 2nm + 2(n − m) − 2j − 1, 1 ≤ j ≤ n − 1.

Suppose the edge of the path Pmi−2 are obtained, hence for 1 ≤ i ≤ n
2
and
n
2
+ 3 ≤ i ≤ n the edge labels of Pmi are labeled as follows:

f ∗ (E(Pmi )) = f ∗ (E(Pmi−2 )) − 4m − 4.
n n
+1 +2
For i = n2 + 1, n2 + 2 the edge of the two internal paths E(Pm2 ) and E(Pm2 )
are labeled by:

f ∗ (E(Pmi )) = f ∗ (E(Pmi−2 )) − 4m − 6.
6 M. Basher

Therefore, f is an even vertex odd mean labeling of θ(n; m). The above case
has been proved for m is odd but when m is even we found it to be a hard
problem to show that the uniform theta θ(n; m) graph is an even vertex odd
mean graph except when m = 4.
Case(ii). When n = 4 and m is even.
Here the vertices of the internal paths Pm1 , Pm2 , Pm3 and Pm4 are labeled as
follows:
{
6m + 2j + 10, 1 ≤ j ≤ m and j is odd
f (u1j ) =
6m + 2j + 6, 1 ≤ j ≤ m and j is even

{
6m − 2j + 10, 1 ≤ j ≤ m and j is odd
f (u2j ) =
6m − 2j + 6, 1 ≤ j ≤ m and j is even

{
2m + 2j + 6, 1 ≤ j ≤ m and j is odd
f (u3j ) =
2m + 2j − 2, 1 ≤ j ≤ m and j is even

{
2m + 4, j=1
f (u4j ) =
2m − 2j + 2, 2 ≤ j ≤ m.

Obviously, the edge labels of the four internal paths are given as follows:
For 1 ≤ j ≤ m − 1

f ∗ (E(Pm1 )) = 6m + 2j + 9
f ∗ (E(Pm2 )) = 6m − 2j + 7
f ∗ (E(Pm3 )) = 6m − 2j + 3.

{
∗ 2m + 1, j=1
f (E(Pm4 )) =
2m − 2j + 1, 2 ≤ j ≤ m.

Thus, f is an even vertex odd mean labeling of θ(n; m).

Example 2.2. The even vertex odd mean labeling f of θ(8; 7) and θ(4; 12)
are given in Figure 4 and Figure 5 respectively.

References
[1] M. Basher, Further results on even vertex odd mean graphs, Journal of
Discrete Mathematical Sciences and Cryptography, Vol. 24 (2021), No. 1,
pp. 93–117.
Even vertex odd mean labeling of uniform theta graphs 7

114 120 118 124 122 128 126

110 112 106 108 102 104 98

82 88 86 92 90 96 94

78 80 74 76 70 72 66

116 50 52 54 56 58 60 62 0

46 44 42 40 38 36 34

18 20 22 24 26 28 30

14 12 10 8 6 4 2

Figure 4: an even vertex odd mean labeling of θ(8; 7)

84 82 88 86 92 90 96 94 100 98 104 102

80 74 76 70 72 66 68 62 64 58 60 54

78 32 26 36 30 40 34 44 38 48 42 52 46 0

28 22 20 18 16 14 12 10 8 6 4 2

Figure 5: an even vertex odd mean labeling of θ(4; 12)

[2] M. Basher, On even vertex odd mean labeling of the calendula graphs,
Proyecciones (Antofagasta), 2020, 39(6):1515-1535.

[3] M. Basher, Even vertex odd mean labeling of some cycle related
graphs, Journal of Discrete Mathematical Sciences and Cryptography,
https://doi.org/10.1080/09720529.2020.1841969.

[4] J. A. Gallian, A dynamic survey of graph labeling. The Electronic Journal

of Combinatorics, Twentieth edition, December 22, 2017, #DS6.

[5] F. Harary, Graph Theory, Addison-wesley, Reading Mass, (1972).

[6] M. Kannan, R. Vikrama Prasad and R. Gopi, Some Graph Operations

Of Even Vertex Odd Mean Labeling Graphs, International Journal of
Applied Engineering Research, 12(18) 2017, 7749-7753.
8 M. Basher

[7] G. Pooranam, R. Vasuki and S. Suganthi, Even vertex odd mean labeling
of transformed trees, SUT Journal of Mathematics, 52(2)(2016), 117-131.

[8] B. Rajan, I. Rajasingh, and P. Venugopal, ‘‘Metric dimension of uniform

and quasi-uniform theta graphs,’’ J. Comput. Math. Sci., vol. 2, no. 1,
pp. 37–46, 2011.

[9] R. Vasuki, A. Nagarajan and S. Arockiaraj, Even vertex odd mean label-
ing of graphs, SUT Journal of Mathematics, 49(2)(2013), 79-92.

[10] R. Vikrama Prasad, M. Kannan and R. Gopi, Some results on even vertex
odd mean labeling graphs, International Journal of Mechanical Engineer-
ing and Technology, 9(2)(2018), 615–621.