A graph G(p, q) is said to be odd harmonious if there exists an injection f : V (G)→ {0, 1, 2, · · · , 2q − 1} such that the induced function f∗ : E(G) → {1, 3, · · · , 2q − 1} defined by f∗(uv) = f(u) + f(v) is a bijection. A graph that admits odd harmonious labeling is called odd harmonious graph. In this paper we prove that any two even cycles sharing a common vertex and a common edge are od...

A vertex bimagic total labeling on a graph with v vertices and e edges is a one to one map taking the vertices and edges onto the integers 1, 2, 3, ...v + e with the property that the sum of the label on the vertex and the labels of its incident edges is one of the constants k1 or k2, independent of the choice of the vertex. In this paper we have discussed that bistar Bn,n are vertex bimagic to...

An injective function f : V (G)→ {0, 1, 2, . . . , q} is an odd sum labeling if the induced edge labeling f∗ defined by f∗(uv) = f(u) + f(v), for all uv ∈ E(G), is bijective and f∗(E(G)) = {1, 3, 5, . . . , 2q − 1}. A graph is said to be an odd sum graph if it admits an odd sum labeling. In this paper, we have studied the odd sum property of the subdivision of the triangular snake, quadrilatera...

let z2 = {0, 1} and g = (v ,e) be a graph. a labeling f : v → z2 induces an edge labeling f* : e →z2 defined by f*(uv) = f(u).f (v). for i ε z2 let vf (i) = v(i) = card{v ε v : f(v) = i} and ef (i) = e(i) = {e ε e : f*(e) = i}. a labeling f is said to be vertex-friendly if | v(0) − v(1) |≤ 1. the vertex balance index set is defined by {| ef (0) − ef (1) | : f is vertex-friendly}. in this paper ...

A vertex magic total labeling on a graph with v vertices and e edges is a one to one map taking the vertices and edges onto the integers with the property that the sum of the label on the vertex and the labels of its incident edges is a constant, independent of the choice of the vertex. A graph with vertex magic total labeling with two constants or is called a vertex bimagic total labeling. The...

For example is a chromatic number with the smallest integer so that graph has true vertex coloring k color. Chromatic still an interesting study which being studied for its development through coloring. Graph special case of labeling. Labeling here means, giving color to points at certain limit no two vertices have same This aims calculate in several classes graphs including , Based on results ...

0