Even Vertex Odd Mean Labeling of Some Graphs

摘要

A graph with p vertices and q edges is said to have an even vertex odd mean labeling if there exists an injective function f:V(G)→{0, 2, 4,... 2q-2,2q} such that the induced map f~*: E(G)→{1, 3, 5, ... 2q-1} defined by f~*(uv)=f(u) + f(v)/2 is a bijection. A graph that admits an even vertex odd mean labeling is called an even vertex odd mean graph. Here we investigate the even vertex odd mean behavior of G_n~((+))(n≥3), slandding ladder SLn(n≥3), VD(P_n), TW(n), double triangular snake D(Q_n), alternative double quadrilateral snake A(D(Q_n)),Q_n□ K_1