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. In this paper we pay our attention to p...

mean labelings are a type of additive vertex labeling. this labeling assigns non-negative integers to the vertices of a graph in such a way that all edge-weights are different, where the weight of an edge is defined as the mean of the end-vertex labels rounded up to the nearest integer. in this paper we focus on mean labelings of some graphs that are the result of the corona operation. in parti...

Let $G$ be a graph with $p$ vertices and $q$ edges. The graph $G$ is said to be a super pair sum labeling if there exists a bijection $f$ from $V(G)cup E(G)$ to ${0, pm 1, pm2, dots, pm (frac{p+q-1}{2})}$ when $p+q$ is odd and from $V(G)cup E(G)$ to ${pm 1, pm 2, dots, pm (frac{p+q}{2})}$ when $p+q$ is even such that $f(uv)=f(u)+f(v).$ A graph that admits a super pair sum labeling is called a {...

An injective function f : V pGq Ñ t0, 1, 2, . . . , qu is an odd sum labeling if the induced edge labeling f defined by f puvq fpuq fpvq, for all uv P EpGq, is bijective and f pEpGqq t1, 3, 5, . . . , 2q 1u. A graph is said to be an odd sum graph if it admits an odd sum labeling. In this paper we study the odd sum property of graphs obtained by duplicating any edge of some graphs.

Let G be a (p, q) graph and let f : V (G) → {1, 2, 3, · · · , p + q} be an injection. For each edge e = uv, let f∗(e) = (f(u)+f(v))/2 if f(u)+f(v) is even and f∗(e) = (f(u)+f(v)+1)/2 if f(u) + f(v) is odd. Then f is called a super mean labeling if f(V ) ∪ {f∗(e) : e ∈ E(G)} = {1, 2, 3, · · · , p+ q}. A graph that admits a super mean labeling is called a super mean graph. In this paper we presen...