EVEN VERTEX ODD MEAN LABELING OF TRANSFORMED TREES

EVEN VERTEX ODD MEAN LABELING OF TRANSFORMED TREES

P. Jeyanthi, D. Ramya, M. Selvi

[PDF]

Abstract

Let G = (V;E) be a graph with p vertices and q edges. A graph G is said have an even vertex odd mean labeling if there exists a function f : V (G) ! f0; 2; 4; :::; 2qg satisfying f is 1-1 and the induced map f : E(G) ! f1; 3; 5; :::; 2q 1g dened by f is a bijection. A graph that admits even vertex odd mean labeling is called an even vertex odd mean graph. In this paper, we prove that Tp-tree (transformed tree), T@Pn, T@2Pn and hT ~oK1;ni (where T is a Tp-tree), are even vertex odd mean graphs.

Keywords

mean labeling, odd mean labeling, Tptree, even vertex odd mean labeling, even vertex odd mean graph.