Volume 4, Issue 5, May– 2019 International Journal of Innovative Science and Research Technology

ISSN No:-2456-2165

Cube Difference Labeling of Theta Graphs

1 2 3
Jagadeeswari P Manimekalai K. Ramanathan K.
2 3
Department of Mathematics BIHER, Chennai, Tamilnadu KCG College of Engineering
1
Ph.D Scholar, Mother Teresa India and Technology,
Women’s University, Kodaikanal, Chennai, Tamilnadu, India.
Tamilnadu, India.

Abstract:- In this work, we prove that the theta graph  Definition 2.5
(Tα), Duplication of any vertex of degree 3 in Tα, path A graph G is a graph obtained by switching the
union of r copies of Tα, one point union of r(Tα), the centreapexv0 of G, removing all the edges incident with v
fusion of any two vertices of Tα, switching of a central and adding edges joining v to every other vertex which
vertex in Tα are Cube difference labeling. are not adjacent to v in G [4].

Keywords:- Cube Difference Labeling (CDL), Fusion, III. MAIN RESULTS

Duplication, Switching, Path Union, One Point Union.
AMS Subject Classification: 0578. A. Theorem 3.1.
The Theta graph (Tα) admits cube difference
I. INTRODUCTION labeling.

The Cube difference labeling were introduced by  Proof:

Shiama [5]. For our study, we consider a simple, Consider the graph G = Tα, the theta graph with
undirected, finite graph and we follow [1,3] for all center v0 and the edge set be
terminology and notations. A dynamic survey on graph
labeling is regularly updated be Gallian [2]. A. E(G) = E1∪ 𝐸2 ∪ 𝐸3, where
Sugumaran and P.Vishnu Prakash [4] proved that theta E1 = {𝑣𝑖 𝑣𝑖+1 /1 ≤ 𝑖 ≤ 5}
graph (Tα) admits Prime Cordial labeling. E2 = {𝑣0 𝑣1 , 𝑣0 𝑣4} and
E3 = {𝑣1 𝑣6}
In section 2, we collect some definitions, which are Now, |𝑉(Tα)| = 7 and |𝐸(Tα)| = 8
needed for the present work.
We explore a vertex valued function as
In section 3, we prove the existence of cube f(vi ) = i – 1, 1 ≤ 𝑖 ≤ 6
difference labeling for some special graphs. f(v0) = 6

II. DEFINITIONS Then the entire eight edges receiving the labels as,
f *(𝑣0 𝑣1) = [𝑓(𝑣0 )]3
 Definition 2.1 𝑓 ∗ (𝑣0𝑣4 ) = |[𝑓(𝑣0 )]3 − [𝑓(𝑣4 )]3 |
A graph G = (V, E) is said to be cube difference 𝑓 ∗ (𝑣𝑖 𝑣𝑖+1 ) = 3𝑖 2 − 3𝑖 + 1, 1 ≤ 𝑖 ≤ 5
graph (CDG) [5] if there exist a bijection 𝑓 ∗ (𝑣1𝑣6) = [𝑓(𝑣6 )]3
g: V(G) → {0,1,2, … 𝑝 − 1} such that the induced function
g*: E(G) →N given by Thus, 𝑓 ∗ (𝑒𝑖 ) ≠ 𝑓 ∗ (𝑒𝑗 ), ∀𝑒𝑖 𝑒𝑗 ∈ 𝐸(𝐺) and all edge
g*(xy) = |[𝑔(𝑥)]3 − [𝑔(𝑦)]3 | is injective ∀𝑥, 𝑦 ∈ 𝐸(𝐺). labeling are definite.
 Definition 2.2 Hence the graph Tα admits cube difference labeling.
A theta graph (Tα) is a block with two non-adjacent For instance, the graph T6 is given below.
vertices of degree 3 and all other vertices of degree 2.

 Definition 2.3
A vertex 𝑣𝑘′ is said to be a duplication of 𝑣𝑘 if all the
vertices which are adjacent to 𝑣𝑘 are now adjacent to 𝑣𝑘′
[4].

 Definition 2.4
A graph 𝐺1 is established by fusing two vertices x
and y (are definite vertices in G) by a single vertex w in
𝐺1 such that every edge which was incident with either x
or y are now incident with w in 𝐺1 [4].

Fig 1:- T6 Admits CDL

IJISRT19MY273 www.ijisrt.com 741

Volume 4, Issue 5, May– 2019 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165
B. Theorem 3.2 Now, determine the vertex valued function g: 𝑉 →
The duplication of any vertex vi of degree 3 in the {0,1, … 7𝑟 − 1} as
cycle of Tα is a cube difference graph. (𝑗)
𝑔(𝑢0 ) = 7j-1
(𝑗)
𝑔(𝑢𝑖 ) = i+7j-8
 Proof:
Let G be the graph obtained by duplication of any
vertex vi in Tα and 𝑣𝑖′ be the duplicating vertex of vi of The edge set E is classified into two classes namely
degree 3. In Tα only two vertices are of degree 3. i.e.,v1 E1 and E2.
and v4.
 E1:
Consider, V(G) = {𝑣𝑗 /0 ≤ 𝑗 ≤ 7}and E(G) = The edge labeled with both of their end vertices
have either odd or even, form an increasing sequence of
{𝑣𝑗 𝑣𝑗+1 /1 ≤ 𝑗 ≤ 5} ∪ {𝑣0𝑣1 , 𝑣0 𝑣4, 𝑣1 𝑣6 }. even integer.
Clearly, |𝑉(𝐺)| = 8 and |𝐸(𝐺)| = 11
Now, define a vertex label 𝑓: 𝑉 → {0,1, … 7} as  E2:
f(vj) = j – 1, 1 ≤ 𝑗 ≤ 6 The edge labeled with one vertex has odd integer
f(v0) = 6 and the other vertex has even integer, form an increasing
sequence of odd integer.
𝑓(𝑣4′ ) = 7, where 𝑣4′ is the duplicating vertex of v4.
For the above labeling pattern, the edge labels f It is easily observed that 𝑔 ∗ (𝑒𝑖 ) ≠ 𝑔 ∗ (𝑒𝑗 ), ∀𝑒𝑖 𝑒𝑗 ∈
*
(𝑣0 𝑣1), 𝑓 ∗ (𝑣0 𝑣4 ) and 𝑓 ∗ (𝑣𝑖 𝑣𝑖+1 ) are same as in the 𝐸(𝐺). For the above defined function f, the induced
above theorem. Thus, all the edge labeling are distinct.
function 𝑔 ∗ : 𝐸(𝐺) → 𝑁 satisfies the condition of cube
Similarly, 𝑓 ∗ (𝑣𝑖−1 𝑣𝑖 ) and 𝑓 ∗ (𝑣𝑖+1 𝑣𝑖′ ) are also distinct. difference labeling. Hence the graph Gis cube difference
Hence the graph G admits CDL. graph. The example for the above graph is illustrated
below.
Example 3.1

Fig 3:- The Path Union of 2(T6) is CDL

D. Theorem 3.4.
The one point union of r copies of theta graph
admits CDL.

 Proof
Fig 2:- Duplication of v4 in T6 Admits CDL Consider G = (V, E) be the one point union of r(Tα).
(𝑗)
Now define V(G) = {𝑢𝑖 , 𝑤/0 ≤ 𝑖 ≤ 5,1 ≤ 𝑗 ≤ 𝑟} and
C. Theorem 3.3
The path union of r copies of theta graph Tα is cube E(G) = {𝑢𝑖(𝑗) 𝑢𝑖+1
(𝑗)
} ∪ {𝑤𝑢𝑖(𝑗) } ∪ {𝑤𝑢5(𝑗) } ∪
difference graph. (𝑗) (𝑗) (𝑗)
{𝑢0 𝑢3 } ∪ {𝑢0 𝑤}
 Proof: Clearly, |𝑉(𝐺)|= 6r+1 and |𝐸(𝐺)|= 8r
Let G be the path union of r(Tα) with the vertex set Define a bijective function 𝑓: 𝑉 → {0,1, … 6𝑟} as follows:
(𝑗)
(𝑗)
V = 𝑢𝑖 , 0≤ 𝑖 ≤ 5, 1≤ 𝑗 ≤ 𝑟 and the edge set E(G) = 𝑓(𝑢0 ) = 6j-1
(𝑗)
E1∪ 𝐸2 ∪ 𝐸3, where 𝑓(𝑢𝑖 ) = i+6j-7 for 1 ≤ 𝑖 ≤ 5, 1 ≤ 𝑗 ≤ 𝑟
(𝑗) (𝑗)
E1 = {𝑢𝑖 𝑢𝑖+1 /1 ≤ 𝑖 ≤ 5} f(w) = 6r
(𝑗) (𝑗) (𝑗) (𝑗)
E2 = {𝑢0 𝑢1 , 𝑢0 𝑢4 /1 ≤ 𝑗 ≤ 𝑟} The edge set E is classified as same as mentioned in
E3 = {𝑢3(𝑗) 𝑢2(𝑗+1) /1
≤ 𝑗 ≤ 𝑟 − 1} the theorem 3.3. Thus 𝑓 ∗ (𝑒𝑖 ) ≠ 𝑓 ∗ (𝑒𝑗 ), ∀𝑒𝑖 𝑒𝑗 ∈ 𝐸(𝐺).
Hence the theorem is verified. For instance, the example
Note that the cardinality of vertices and edges are7r of 4(Tα) given below.
and9r-1resp.,

IJISRT19MY273 www.ijisrt.com 742

Volume 4, Issue 5, May– 2019 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165

Fig 5:- Theta Graph

Fig 4:- CDL of 4(T6)

E. Theorem 3.5
The fusion (identifying) of any two vertices in the
cycle of Tα is CDL.

 Proof:
Let Tα be the graph with centrev0, the vertex set V =
{u0, u1,…u6} and the edge set
E = E1∪ 𝐸2 , where E1 = {𝑢𝑖 𝑢𝑖+1 /1 ≤ 𝑖 ≤ 6} and
E2 = {𝑢0 𝑢1 , 𝑢0 𝑢4 , 𝑢1 𝑢6 }
Note that |𝑉(𝑇𝛼 )|= 7 and |𝐸(𝑇𝛼 )|= 8 Fig 6:- The Fusion of u5 and u6 in Theta Graph is CDG

Now, after the fusion of two vertices 𝑢5 and 𝑢6 in F. Theorem 3.6

the cycle of Tα and we call it as 𝑢5 we obtain the graph G. The switching of a central vertex in Tα is cube
Clearly, |𝑉(𝐺)|= 6 and |𝐸(𝐺)|= 7. Define the vertex difference graph.
valued function 𝑓: 𝑉 → {0,1, … 5} as
f(u0) = 5  Proof
f(ui ) = i-1 Let the graph G is obtained by switching the central
vertex x0in Tαwith the vertices𝑥0, 𝑥1, … , 𝑥6 and the
Then the induced function f * yields edge labels as, edges{𝑥𝑗 𝑥𝑗+1 /1 ≤ 𝑗 ≤ 6} ∪ {𝑥0 𝑥2 , 𝑥0 𝑥3, 𝑥0 𝑥5, 𝑥0 𝑥6}.
f (𝑢0 𝑢1 ) = [𝑓(𝑢0 )]3
*

𝑓 ∗ (𝑢0 𝑢4 ) = |[𝑓(𝑢0 )]3 − [𝑓(𝑢4 )]3 | The cardinality of vertices and edges are 7 and 10
𝑓 ∗ (𝑢𝑖 𝑢𝑖+1 ) = 3𝑖 2 − 3𝑖 + 1, resp.,
𝑓 ∗ (𝑢1 𝑢5 ) = [𝑓(𝑢5 )]3
Define the bijective function 𝑓: 𝑉 → {0,1, … 6} as
It is easily observed that all the edge labels are f(x0) = 6
distinct. Hence the graph G admits CDL. For the above f(xj) = j-1
graph, the example mentioned in fig 5 and 6.
For the above labeling pattern, the induced function
f * obtain the edge as
𝑓 ∗ (𝑥𝑗 𝑥𝑗+1 ) = 3𝑗 2 − 3𝑗 + 1, 1 ≤ 𝑗 ≤ 5
𝑓 ∗ (𝑥0 𝑥2) = 215
𝑓 ∗ (𝑥0 𝑥3) = 208
𝑓 ∗ (𝑥0 𝑥5) = 152
𝑓 ∗ (𝑥0 𝑥6) = 91

Clearly, the entire 10 edge labels are distinct.

Therefore, the graph G is cube difference graph.

IJISRT19MY273 www.ijisrt.com 743

Volume 4, Issue 5, May– 2019 International Journal of Innovative Science and Research Technology
ISSN No:-2456-2165
Example 3.2

Fig 7:- The Switching of x0 in Theta Graph is CDG

IV. CONCLUSION

In this paper, we investigated that the theta graph Tα

and its associated graphs are cube difference graph.

REFERENCES

[1]. Frank Harary, Graph theory, Narosa Publishing

House, 2001.
[2]. J.A. Gallian, A dynamic survey of graph labeling,
The Electronics journal of Combinatories, 17 (2010)
#DS6.
[3]. A. Rosa, On Certain valuation of graph , theory of
graphs (Rome, July 1966), Golden and Breach. N.Y
and Paris, (1967), 349355.
[4]. Sugumaran and P. Vishnu Prakash, Prime Cordial
labeling for theta graph, Annals of Pure and Applied
Mathematics, 14(3) (2017), 379386. ISSN: 2279-
087X.
[5]. J. Shiama, Cube difference labeling of some graphs,
IJESIT, 2(6) (2013).

IJISRT19MY273 www.ijisrt.com 744