Scribd
Upload
64 views5 pages

Ajms 487 23

The document presents research on k-Super Lehmer-3 mean labeling of graphs. It defines k-Super Lehmer-3 mean labeling as an injective vertex labeling and induced edge labeling that uses the vertices and edges to label the set {k, k+1, ..., k + p + q - 1}. It proves that several snake graphs (triangular, double triangular, alternative triangular, quadrilateral, etc.) are k-Super Lehmer-3 mean graphs for any value of k.

Uploaded by

BRNSS Publication Hub Info
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
64 views5 pages

Ajms 487 23

The document presents research on k-Super Lehmer-3 mean labeling of graphs. It defines k-Super Lehmer-3 mean labeling as an injective vertex labeling and induced edge labeling that uses the vertices and edges to label the set {k, k+1, ..., k + p + q - 1}. It proves that several snake graphs (triangular, double triangular, alternative triangular, quadrilateral, etc.) are k-Super Lehmer-3 mean graphs for any value of k.

Uploaded by

BRNSS Publication Hub Info
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 5

RESEARCH ARTICLE

K-SUPER CONTRA HARMONIC MEAN LABELING OF GRAPHS

R. Gopi*, V. Prakash1
*
Assistnat Professor, Department of Mathematics, Srimad Andavan Arts and Science
College(Autonomous),Tiruchirappalli, Tamilnadu, India
1
Assistnat Professor, Department of Mathematics, National College(Autonomous),
Tiruchirappalli, Tamilnadu, India

Corresponding Email: drrgmaths@gmail.com

Received: 15-05-2023 ; Revised: 10-06-2023; Accepted: 12-07-2023

ABSTRACT

In Let f : V (G )  {k , k  1, k  2, ..., k  p  q  1} be an injective function. Then the induced edge labeling


 f (u )  f (u ) f (v)  f (v)   f (u )  f (u ) f (v)  f (v) 
f * ( e)    or  
f (e  uv) defined by
*
 3   3 
, then f is called k-Super
heronian Mean labeling, if { f (V (G ))}  { f ( e ) / e  E (G )}  {k , k  1, k  2, ..., k  p  q  1} .
A graph which admits k-super heronian mean labeling is called a k-super heronian mean graph. In this
paper we introduce and study k-super heronian mean labeling graph. Here k denoted as any positive
integer greater than or equal to 1.

Keywords: k-Super Lehmer-3 mean Labeling, k-Super Lehmer-3 mean graph, triangular snake, double
triangular snake, Alternative triangular snake, quadrilateral snake, double quadrilateral snake, Alternative
quadrilateral snake.

INTRODUCTION

A graph considered here are finite, undirected and simple. Let G(V, E) be a graph with p vertices and q
edges. For standard terminology and notations, we follow[3]. For detailed survey of graph labeling we
refer to Gallian [1].The concept of Super Lehmer-3 Mean Labeling was introduced and studied by[4] and
also studied [2]. In this paper we introduce the concept of k-Super Lehmer-3 Mean Labeling and we
investigate the k-Super Lehmer-3 meanness of triangular snake, Double triangular snake, Alternative
triangular snake, quadrilateral snake, Double quadrilateral snake and Alternative quadrilateral snake.

www.ajms.in
K-SUPER CONTRA HARMONIC MEAN LABELING OF GRAPHS

MAIN RESULTS

Definition 2.1:

Let f : V (G )  {1, 2, ..., p  q} be an injective function. Then the induced edge labeling f (e  uv) defined by
*

 f (u ) 3  f (v) 3   f (u ) 3  f (v) 3 
f * (e)   2
or  2
 f (u )  f (v)   f (u )  f (v) 
2 2

,then f is called Super lehmer 3-mean labeling, if { f (V (G ))}  { f (e) / e  E (G )}  {1, 2, ..., p  q} .
A graph which admits super lehmer 3-mean labeling is called a super lehmer 3-mean graph.

Definition 2.2:

Let f : V (G )  {k , k  1, k  2, ..., k  p  q  1} be an injective function. Then the induced edge labeling

 f (u ) 3  f (v) 3   f (u ) 3  f (v) 3 
f *
( e)   2
or  2
f * (e  uv) defined by  f (u )  f (v)   f (u )  f (v)  ,
2 2

then f is called k-Super lehmer 3-mean labeling,

if { f (V (G ))}  { f (e) / e  E (G )}  {k , k  1, k  2, ..., k  p  q  1} .

A graph which admits k-super lehmer 3-mean labeling is called a k-super lehmer 3-mean graph.

Theorem 2.3:
Tn (n  2)
The triangular snake is a k-Super Lehmer-3 Mean graph for any k.

Proof
Let
vi ,1  i  n, ui ,1  i  n  1be the vertices and ei ,1  i  n, ai ,1  i  2(n  1)be the edges.

First we label the vertices as follows:


1  i  n, f (vi )  k  5(i  1)
For
1  i  n  1, f (ui )  k  5i  3
For

Then the induced edge labels are:


1  i  n  1, f * (ei )  k  5i  2
For

 2k  5i  3
 i is odd
1  i  2(n  1), f (ai )  
* 2
2k  5i  2
 i is even
For  2

Tn (n  2)
Therefore, the edge labels are all distinct. Hence the triangular snake is a k-super lehmer-3
mean graph for any k.

113
AJMS/Jul-Sep 2023/Volume 7/Issue 3
K-SUPER CONTRA HARMONIC MEAN LABELING OF GRAPHS

Theorem 2.4:
The double triangular snake D(Tn )( n  2) is a k-Super Lehmer-3 Mean graph for any k.

Proof
Let
vi ,1  i  n, ui , wi 1  i  n  1be the vertices and
ei ,1  i  n, ai , bi 1  i  2(n  1)be the
edges.

First we label the vertices as follows:


For 1  i  n, f (vi )  k  8(i  1)
For 1  i  n  1, f (ui )  k  8i  6, f ( wi )  k  8i  2

Then the induced edge labels are:


1  i  n  1, f * (ei )  k  8i  4
For
For 1  i  2(n  1) ,
 k  4i  3 i is odd
f * ( ai )  
k  4i  5 i is even
 k  4i  1 i is odd
f * (bi )  
k  4i  1 i is even
Therefore, the edge labels are all distinct. Hence the double triangular snake D(Tn )( n  2) is a k-super
lehmer-3 mean graph for any k.

Theorem 2.5:
A(Tn )( n  2)
The alternative triangular snake is a k-super lehmer-3 mean graph for any k.

Proof
 n
vi ,1  i  n, ui , 1  i  
Let  2  be the vertices and ei ,1  i  n  1, ai ,1  i  nbe the edges.
First we label the vertices as follows:

1  i  n, f (vi )  k  2(i  1)
For
n
1  i  , f (u i )  k  2n  3(i  1)
For 2

Then the induced edge labels are:

1  i  n  1, f * (ei )  k  2i  1
For

For 1  i  n ,
 2k  4n  3i  5
 i is odd
f * ( ai )   2
2k  4n  3i  4
 i is even
 2

114
AJMS/Jul-Sep 2023/Volume 7/Issue 3
K-SUPER CONTRA HARMONIC MEAN LABELING OF GRAPHS

 k  4i  1 i is odd
f * (bi )  
k  4i  1 i is even
Therefore, the edge labels are all distinct. Hence the alternative triangular snake A(Tn )( n  2) is a k-super
lehmer-3 mean graph for any k.

Theorem 2.6:
The quadrilateral snake Qn (n  2) is a k-Super Lehmer-3 Mean graph for any k.

Proof
 
Let vi ,1  i  n, ui , wi 1  i  n  1be the vertices and ai , bi , ci ,1  i  n  2, ei ,1  i  n  1 be the
edges.

First we label the vertices as follows:


For 1  i  n, f (vi )  k  7(i  1)
For 1  i  n  1, f (ui )  k  7i  5 f (wi )  k  7i  2
Then the induced edge labels are:
1  i  n  2, f * (ai )  k  7i  6
For
f * (bi )  k  7i  1 f * (ci )  k  7i  3
f * (ei )  k  7i  4
For 1  i  n ,
Therefore, the edge labels are all distinct. Hence the quadrilateral graph Qn (n  2) is a k-super lehmer-3
mean graph for any k.

Theorem 2.7:
A(Qn )( n  2)
The Alternative quadrilateral snake is a k-Super Lehmer-3 Mean graph for any k.

Proof
 n
ai , 1  i  n, ei ,1  i  n  1, bi ,1  i  
v , w , 1  i  nbe the vertices and
Let i i  2  be the edges.
First we label the vertices as follows:
1  i  n, f (vi )  k  2(i  1)
For
 2k  4n  5(i  1)
 i is odd
f (ui )   2
2k  4n  5i  6
 i is even
For 1  i  n,  2

Then the induced edge labels are:


1  i  n  1, f * (ei )  k  2i  6
For
 2k  4n  5i  7
 i is odd
f * ( ai )   2
2k  4n  5i  4
 i is even
For 1  i  n,  2
n
1  i  , f * (bi )  k  2n  5i  2
For 2

115
AJMS/Jul-Sep 2023/Volume 7/Issue 3
K-SUPER CONTRA HARMONIC MEAN LABELING OF GRAPHS

Therefore, the edge labels are all distinct. Hence the Alternative quadrilateral snake A(Qn )( n  2) is a k-
Super Lehmer-3 Mean graph for any k.

Theorem 2.8:
The Double quadrilateral snake D(Qn )( n  2) is a k-super lehmer-3 mean graph for any k.

Proof
Let
vi ,1  i  n, ui , wi , 1  i  2(n  1)be the vertices and
ei , ai , ci 1  i  n  1, bi , d i , 1  i  2(n  1)be the edges.
First we label the vertices as follows:

For 1  i  n, f (vi )  k  12(i  1)


 k  6i  4 i is odd
f (ui )  
For 1  i  2(n  1), k  6i  8 i is even
k  6i  2 i is odd
f ( wi )  
k  6i  2 i is even

Then the induced edge labels are:

1  i  n  1, f * (ei )  k  12i  6 f * (ci )  k  12i  3


For
 k  6i  5 i is odd
f * (bi )  
For 1  i  2(n  1), k  6i  7 i is even
 k  6i  2 i is odd
f * (d i )  
k  6i  2 i is even
D(Qn )( n  2)
Therefore, the edge labels are all distinct. Hence the Double quadrilateral snake is a k-
super lehmer-3 mean graph for any k.

References
1. J.A. Gallian, A dynamic survey of graph labeling, The Electronic Journal of Combinatorics,
17(2022), D#S6.
2. R.Gopi and V.Suba, Super Lehmer-3 mean labeling of tree related graphs, International
Journal of Mathematics and its Applications,5(3-A)(2016),25-27.
3. F. Harary,Graph Theory, Narosa Publication House Reading, New Delhi 1998.
4. S.S Sandhya ,S.Somasundaram, and S.Anusa ,Super Lehmer-3 mean labeling of graphs,
International Journal of Contemp.Math.Sciences,Vol.9,14(2014), 667-676.

116
AJMS/Jul-Sep 2023/Volume 7/Issue 3

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy