International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169

Volume: 5 Issue: 6 05 07
_______________________________________________________________________________________________
Oblong Mean Prime Labeling of Some Snake Graphs

Sunoj B S Mathew Varkey T K

Assistant Professor Assistant Professor
Government Polytechnic College TKM College of Engineering
Attingal, Kerala,India Kollam, Kerala,India
spalazhi@yahoo.com mathewvarkeytk@gmail.com

AbstractA graph labeling is an assignment of integers to the vertices or edges or both subject to certain conditions. The graph
for which every edge(uv),the labels assigned to u and v are oblong numbers and for each vertex of degree at least 2, the g c d of
the labels of the incident edges is 1. Here we characterize some snake graphs for oblong mean prime labeling.

Keywords- Graph labeling, prime graphs, prime labeling, oblong numbers, snake graphs.
__________________________________________________*****_________________________________________________

I. INTRODUCTION Proof: Let G = Tn and let v1,v2,----------------,v2n-1 are the

vertices of G
All graphs in this paper are simple, connected, finite and
Here |V(G)| = 2n-1 and |E(G)| = 3n-3
undirected. The symbol V(G) and E(G) denotes the vertex set
Define a function f : V {2,6,12,--------------,(2 1)(2) }
and edge set of a graph G. The graph whose cardinality of the
by
vertex set is called the order of G, denoted by p and the
f(vi) = i(i+1) , i = 1,2,------,2n-1.
cardinality of the edge set is called the size of the graph G,
Clearly f is a bijection.
denoted by q. A graph with p vertices and q edges is called a
For the vertex labeling f, the induced edge labeling is
(p,q)- graph.
defined as follows
A graph labeling is an assignment of integers to the vertices or
( +1 ) = ( i+1)2, i = 1,2,------,2n-2
edges. Some basic notations and definitions are taken from

[1],[2] and [3]. Some basic concepts are taken from [1]. In [4], (21 2+1 ) 2
= 4i +2i+1, i = 1,2,------,n-1

we introduced the concept oblong mean prime labeling and Clearly is an injection.

proved that some path related graphs admit oblong mean g c d of (vi+1) = g c d of { ( +1 ) , (+1 +2 ) }
2 2
prime labeling. In this paper we investigated oblong mean = g c d of { (i+1) , (i+2) }
prime labeling of some snake graphs. = g c d of {i+1 , i+2} = 1, i = 1,2,------,2n-3

Definition: 1.1 Let G be a graph with p vertices and q edges. g c d of (v1) = g c d of { (1 2 ) , (1 3 ) }
The greatest common divisor of a vertex of degree greater than = g c d of {4,7} = 1.

or equal to 2, is the g c d of the labels of the incident edges. g c d of (v2n-1) = g c d of { (22 2 1 ),
Definition: 1.2 An oblong number is the product of a number
(23 21 ) }
with its successor, algebraically it has the form n(n+1).The
= g c d of { 4n2-4n+1, 4n2-6n+3}
oblong numbers are 2, 6, 12, 20, --------------.
= g c d of { (2n-2), (4n2-6n+3)} = 1.
So, g c d of each vertex of degree greater than one is 1.
II. MAIN RESULTS Hence Tn, admits oblong mean prime labeling.
Theorem 2.2 Double triangular snake D(Tn) admits oblong
Definition 2.1 Let G be a graph with p vertices and q edges .
mean prime labeling.
Define a bijection f : V(G) {2,6,12,20 ,--------------,p(p+1)}
Proof: Let G = D(Tn) and let v1,v2,----------------,3 2 are
by f(vi) = ( + 1) , for every i from 1 to p and define a 1-1
the vertices of G
mapping : E(G) set of natural numbers N by
Here |V(G)| = 3n-2 and |E(G)| = 5n-5
+()
() = . The induced function is said to Define a function f : V {2,6,12,--------,(3 2)(3 1) }
2
be an oblong mean prime labeling, if the g c d of each vertex by
of degree at least 2, is one. f(vi) = i(i+1) , i = 1,2,------,3n-2.
Definition 2.2 A graph which admits oblong mean prime Clearly f is a bijection.

labeling is called an oblong mean prime graph. For the vertex labeling f, the induced edge labeling is
Theorem 2.1 Triangular snake Tn admits oblong mean prime defined as follows

labeling. (32 3 ) = 9i2-3i+1, i = 1,2,------------,n-1.

5
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 05 07
_______________________________________________________________________________________________

(3 3+1 ) = 9i2+6i+1, i = 1,2,------------,n-1. g c d of (v3n-2) = g c d of { (32 33 ) ,

(32 31 )= 9i -6i+1,
2
i = 1,2,------------,n-1. (35 32 ) }

(31 3+1 )= 9i2+3i+1, i = 1,2,------------,n-1. = g c d of {(3n-2)2, 9n2-18n+11}

(32 3+1 )= 9i +2,
2
i = 1,2,------------,n-1. = g c d of {3n-2 , 3 }= 1.
So, g c d of each vertex of degree greater than one is 1.
Clearly is an injection.
g c d of (v3i)
= g c d of { (3 32 ) , Hence Qn, admits oblong mean prime labeling.
Theorem 2.4 Alternate triangular snake A(T n) admits oblong
(3 3+1 ) }
mean prime labeling, when n is odd and triangle starts from
= g c d of {9i2-3i+1 , 9i2+6i+1 }
the first vertex.
= g c d of {9i2-3i+1 , 9i }
Proof: Let G = A(Tn) and let v1,v2,----------------,(31)/2
= g c d of {6i+1 , 9i}
are the vertices of G
= g c d of {3i-1 , 6i+1} 31
= g c d of {3, 3i-1} = 1, i = 1,2,---------,n-1. Here |V(G)| = and |E(G)| = 2n-2
2
31 3+1
g c d of (v3i-1) = g c d of { (32 31 ) , Define a function f : V {2,6,12,--------------,( )( )}
2 2

(31 3+1 ) } by
= g c d of {9i2-6i+1 , 9i2+3i+1 } f(vi) = i(i+1) , i = 1,2,------,
31
.
2
= g c d of {9i2-6i+1 , 9i }
Clearly f is a bijection.
= g c d of {3i+1 , 9i}
For the vertex labeling f, the induced edge labeling is
= g c d of {3i-2 , 3i+1}
defined as follows
= g c d of {3, 3i-2} = 1, i = 1,2,-------,n-1. 1

g c d of (v3i+1)
= g c d of { (3+1 3+2 ) , (32 3 ) = 9i2-3i+1, i = 1,2,------------, .
2
33
(3 3+1 ) } ( +1 ) 2
= i +2i+1, i = 1,2,------------, .
2
= g c d of {(3i+1)2, (3i+2)2} Clearly f is an injection.
= g c d of {3i+1 , 3i+2 } 35
g c d of (vi+1) = 1, i = 1,2,------------, .
= g c d of {6i+1 , 9i} 2
g c d of (v1) = g c d of {4,7}.
= g c d of {3i-1 , 6i+1}= 1, i = 1,2,------,n-2.
So, g c d of each vertex of degree greater than one is 1.
g c d of (v1) = g c d of { (1 2 ) , (1 3 ) }
Hence A(Tn), admits oblong mean prime labeling.
= g c d of {4,7} = 1.
Theorem 2.4 Alternate triangular snake A(T n) admits oblong
g c d of (v3n-2) = g c d of { (32 33 ) ,

mean prime labeling, when n is odd and triangle starts from
(34 32 ) } the first vertex.
= g c d of {(3n-2)2, 9n2-15n+7} Proof: Let G = A(Tn) and let v1,v2,----------------,(31)/2
= g c d of {3n-2 , 9n2-15n+7 }= 1. are the vertices of G
So, g c d of each vertex of degree greater than one is 1. 31
Here |V(G)| = and |E(G)| = 2n-2
Hence D(Tn), admits oblong mean prime labeling. 2
31 3+1
Theorem 2.3 Quadrilateral snake Qn admits oblong mean Define a function f : V {2,6,12,--------------,( )( )}
2 2
prime labeling. by
Proof: Let G = Qn and let v1,v2,----------------,32 are the 31
f(vi) = i(i+1) , i = 1,2,------, .
2
vertices of G
Clearly f is a bijection.
Here |V(G)| = 3n-2 and |E(G)| = 4n-4
For the vertex labeling f, the induced edge labeling is
Define a function f : V {2,6,12,--------,(3 2)(3 1) }
by defined as follows
1
f(vi) = i(i+1) , i = 1,2,------,3n-2. (32 3 ) = 9i2-3i+1, i = 1,2,------------, .
2
Clearly f is a bijection. 33
( +1 ) = i2+2i+1, i = 1,2,------------, .
2
For the vertex labeling f, the induced edge labeling is
Clearly f is an injection.
defined as follows 35
g c d of (vi+1) = 1, i = 1,2,------------, .
(32 3+1 ) = 9i2+2, i = 1,2,-------,n-1. 2
g c d of (v1) = g c d of {4,7}.
( +1 ) = i2+2i+1, i =1,2,------,3n-3.
So, g c d of each vertex of degree greater than one is 1.
Clearly f is an injection.
Hence A(Tn), admits oblong mean prime labeling.
g c d of (vi+1) = 1, i = 1,2,------------,3n-4
Theorem 2.5 Alternate triangular snake A(T n) admits oblong
g c d of (v1) = g c d of {4,11}.
mean prime labeling, when n is odd and triangle starts from
the second vertex.
6
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________
International Journal on Recent and Innovation Trends in Computing and Communication ISSN: 2321-8169
Volume: 5 Issue: 6 05 07
_______________________________________________________________________________________________

Proof: Let G = A(Tn) and let v1,v2,----------------,(31)/2 g c d of (v(3n)/2) = g c d of{ ((3)/2 (32)/2 ),

are the vertices of G ((34)/2 (3)/2 )}
31 9 2 6+4 9 2
Here |V(G)| = and |E(G)| = 2n-2 = g c d of { , }
2 4 4
31 3+1
Define a function f : V {2,6,12,---------------,( )( )} 32 9 2 6+4
2 2 = g c d of { , }
2 4
by
31
= 1.
f(vi) = i(i+1) , i = 1,2,------, . So, g c d of each vertex of degree greater than one is 1.
2
Clearly f is a bijection. Hence A(Tn), admits oblong mean prime labeling.

For the vertex labeling f, the induced edge labeling is Theorem 2.7 Alternate triangular snake A(Tn) admits oblong
defined as follows mean prime labeling, when n is even and triangle starts from
1 the second vertex.
(31 3+1 ) = 9i2+3i+1, i = 1,2,------------, .
2
33 Proof: Let G = A(Tn) and let v1,v2,----------------,(3 )/2 are

( +1 ) = i2+2i+1, i = 1,2,------------, .
2 the vertices of G
Clearly f is an injection. 32
35
Here |V(G)| = and |E(G)| = 2n-3
2
g c d of (vi+1) = 1, i = 1,2,------------, . 32 3
2 Define a function f : V {2,6,12,-----------------,( )( ) }
2 2
g c d of (v(3n-1)/2) = g c d of{ ((31)/2 (33)/2 ),
by
((35)/2 (31)/2 )} 32
9 2 6+1 9 2 12+7
f(vi) = i(i+1) , i = 1,2,------, .
2
= g c d of { , }
4 4 Clearly f is a bijection.
33 9 2 12+7
= g c d of { , }= 1. For the vertex labeling f, the induced edge labeling is
2 4
. defined as follows
2
So, g c d of each vertex of degree greater than one is 1. (31 3+1 ) = 9i2+3i+1, i = 1,2,------------, .
2
Hence A(Tn), admits oblong mean prime labeling. 34
( +1 ) 2
= i +2i+1, i = 1,2,------------, .
Theorem 2.6 Alternate triangular snake A(T n) admits oblong 2
Clearly f is an injection.
mean prime labeling, when n is even and triangle starts from 36
the first vertex. g c d of (vi+1) = 1, i = 1,2,------------, .
2
Proof: Let G = A(Tn) and let v1,v2,----------------,(3)/2 are So, g c d of each vertex of degree greater than one is 1.
the vertices of G Hence A(Tn), admits oblong mean prime labeling.
3
Here |V(G)| = and |E(G)| = 2n-1
2
3 3+2 REFERENCES
Define a function f : V {2,6,12,-----------------,( )( )}
2 2
[1] F Harary, Graph Theory, Addison-Wesley, Reading,
by
3
Mass.(1972)
f(vi) = i(i+1) , i = 1,2,------, . [2] Joseph A Gallian, A Dynamic Survey of Graph
2
Clearly f is a bijection. Labeling, The Electronic Journal of Combinatorics,

For the vertex labeling f, the induced edge labeling is #DS6,(2016) pp 1 408.
defined as follows [3] T K Mathew Varkey, Some Graph Theoretic
32 Generations Associated with Graph Labeling, PhD
(32 3 ) = 9i2-3i+1, i = 1,2,------------, .
2
Thesis, University of Kerala (2000).
( +1 ) = i2+2i+1, i = 1,2,------------, .
2 [4] T K Mathew Varkey, Sunoj B S, Oblong Mean Prime
Clearly f is an injection. Labeling of Some Path Graphs, Aryabhatta Journal of
34
g c d of (vi+1) = 1, i = 1,2,------------, . Mathematics and Informatics, Volume 9, Issue
2
g c d of (v1) = g c d of {4,7}. 1,(2017),pp 320-326.

7
IJRITCC | June 2017, Available @ http://www.ijritcc.org
_______________________________________________________________________________________