Abstract
An even vertex odd mean labeling of an undirected graph with q edges is a one to one function f from the set of vertices V(G) to the set 0, 2, 4, ... , 2q such that the induced function f* from E(G) to the set 1, 3, 5, ... , 2q - 1 defined by
is a bijection. A graph that admits an even vertex odd mean labeling is called even vertex odd mean graph. In this paper, we prove that D
2
(P
n
), D
2
(L
n
), D
2
([P
2n
, S
m
]), S(L
n
), S(P
n
⊗ K
1
), S(SL
n
), S′(P
n
), S′(k
2,n
), S′(P
n
⊗ K
1
), S′(C
n
) for n ≡ 0 (mod 4) and S′([P
2n
, S
m
]) are even vertex odd mean graphs.