EVEN VERTEX ODD MEAN LABELING OF TRANSFORMED TREES

Özet

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) →{0, 2, 4, ..., 2q} satisfying f is 1-1 and the induced map f ∗: E(G) → {1, 3, 5, ..., 2q − 1}defined 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 hToK˜ 1,ni (where T is a Tp-tree), are even vertex odd mean graphs.