Many more families of mean graphs

For every assignment f: V(G)→{0, 1, 2, . . . , q}, an induced edge labeling f* : E(G) → {1, 2, 3, . . . , q}is defined by 2 f (u) + f (v) if f (u) and f (u) are of same parity and by 2 f(u) + f (v) +1 otherwise for every edge uv∈E (G). If f *(E) = {1, 2, 3, . . . , q} , then we say that f is a mean labeling of G. If a graph G admits a mean labeling, then G is called a mean graph. In this paper, we prove that the graphs Cn+v1v3 (n≥4), C2(Pn), n≥2, Tn(Cm), n ≥ 2, m≥3, DQ(n), n ≥ 2, TQ(n), n ≥ 2 and mCn– snake, m ≥ 1, n ≥ 3 are mean graphs.