Let G = be a graph, with and . An injective mapping is called an even-odd harmonious labeling of the graph G, if induced edge such that (i) bijective (ii) The acquired from this graph. In paper, we discovered some interesting results like H-graph, comb bistar for labeling.

Graphs that have the properties of odd harmonious labeling are graphs. The research objective this paper is to obtain on layered graph C(x,y) and D(x,y). used in a qualitative method. flow consists data collection, processing, analysis. collection stage constructing definition new class graph, processing vertex edge labeling, analysis theorem proving it. results show D(x,y) fulfill labeling. Su...

let g be a (p,q) graph. an injective map f : e(g) → {±1,±2,...,±q} is said to be an edge pair sum labeling if the induced vertex function f*: v (g) → z - {0} defined by f*(v) = σp∈ev f (e) is one-one where ev denotes the set of edges in g that are incident with a vertex v and f*(v (g)) is either of the form {±k1,±k2,...,±kp/2} or {±k1,±k2,...,±k(p-1)/2} u {±k(p+1)/2} according a...

The even graceful labeling of a graph G with q edges means that there is an injection f : V(G) to { 0,1,1,1,2,...,2q+i/i= 1 to n} such that when each edge uv is assigned the label |f(u) – f(v)| the resulting edge labels are {1,3,5,...,2q-1}. A graph which admits an edge odd graceful labeling is called an edge-odd graceful graph. In this paper, the edge odd gracefulness of paths p1, p2, p3,..., ...

Let G be a graph and f : V (G) → {1, 2, 3, . . . , p+ q} be an injection. For each edge e = uv and an integer m ≥ 2, the induced Smarandachely edge m-labeling f∗ S is defined by f ∗ S(e) = ⌈ f(u) + f(v) m ⌉ . Then f is called a Smarandachely super m-mean labeling if f(V (G))∪ {f∗(e) : e ∈ E(G)} = {1, 2, 3, . . . , p+ q}. Particularly, in the case of m = 2, we know that f ∗(e) =    f(u)+f(v) ...

A function f is called an odd-even graceful labeling of a graph G if f: V(G) → {0,1,2,...,q} is injective and the induced function f : E(G) → { { 0,2,4,...,2q+2i/i= 1 to n} such that when each edge uv is assigned the label |f(u) – f(v)| the resulting edge labels are {2,4,6,...,2q}. A graph which admits an odd-even graceful labeling is called an odd-even graceful graph. In this paper, the odd-ev...