A graph labeling is an assignment of integers to the vertices or edges, or both, subject to
certain conditions. Graph labelings were first introduced in the mid 1960s. In the intervening …

Let G=(V, E) be a graph with p vertices and q edges is said to be a two modulo three sum
graph if there is an injective function f from V (G) to {a∶ 0≤ a≤ 3q-1 and either a≡ 0 (mod …

Odd Sum Labeling of Alternative Quadrilateral Snake Page 1 Received: 02 June, 2016;
Revised: 27 August, 2016; Accepted: 14 September, 2016 International Journal of Engineering …

An injective function $ f: V (G)\rightarrow\{0, 1, 2,\dots, q\} $ is an odd sum labeling if the
induced edge labeling $ f^* $ defined by $ f^*(uv)= f (u)+ f (v), $ for all $ uv\in E (G), $ is …

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 a bijective and f∗(E (G))={1, 3 …

Odd Sum Labeling of Some More Graphs Page 1 Received: 20 June, 2016; Revised: 07
September, 2016; Accepted: 02 November, 2016 *Corresponding Author International Journal of …

Graf () dengan banyak titik dan sisi merupakan graf jumlah ganjil jika sebuah fungsi injektif
()*+ merupakan pelabelan jumlah ganjil pada dan pelabelan sisi terinduksinya yang …