Title of article
EVEN VERTEX ODD MEAN LABELING OF TRANSFORMED TREES
Author/Authors
JEYANTH, P Department of Mathematics - Govindammal Aditanar College for Women - Tiruchendur - Tamilnadu, India , RAMYA, D Department of Mathematics - Government Arts College for Women - Ramanathapuram - Tamilnadu, India , SELVI, M Research Scholar - Manonmaniam Sundaranar University - Abishekapatti - Tirunelveli - Tamilnadu, India
Pages
8
From page
338
To page
345
Abstract
Let G = (V, E) be a graph with p vertices and q edges. A graph G is
(transformed tree), T@Pn, T@2Pn and hToK˜ 1,ni (where T is a Tp-tree), are even vertex
labeling is called an even vertex odd mean graph. In this paper, we prove that Tp-tree
2
defined by f is a bijection. A graph that admits even vertex odd mean ∗
(uv) =
f(u)+f(v)
{0, 2, 4, ..., 2q} satisfying f is 1-1 and the induced map f
∗
: E(G) → {1, 3, 5, ..., 2q − 1}
said have an even vertex odd mean labeling if there exists a function f : V (G) →
Keywords
mean labeling , odd mean labeling , Tp−tree , even vertex odd mean labeling , even vertex odd mean graph
Journal title
Turkish World Mathematical Society Journal of Applied and Engineering Mathematics
Serial Year
2020
Record number
2588917
Link To Document