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 …

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) …

Abstrak (dua bahasa: Inggris dan Indonesia)• menarik perhatian dan mendorong pembaca
meluangkan waktu untuk mendapatkan dan membaca full paper• Singkat, jelas dan lengkap …

I. INTRODUCTION Throughout this paper, by a graph we mean a finite, simple and
undirected one. For standard terminology and notation we follow Harary [6]. A graph G=(V …

Graphs that have the properties of odd harmonious labeling are odd harmonious graphs.
The research objective of this paper is to obtain odd harmonious labeling on layered graph …

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 …

SOME RESULTS ON ODD HARMONIOUS LABELING OF GRAPHS Page 1 BULLETIN OF
THE INTERNATIONAL MATHEMATICAL VIRTUAL INSTITUTE ISSN (p) 2303-4874, ISSN (o) …

Graf dengan sifat pelabelan harmonis ganjil disebut sebagai graf harmonis ganjil. Tujuan
penelitian ini adalah menemukan sifat pelabelan harmonis ganjil pada beberapa kelas graf …

An odd harmonious labeling of a graph G is an injective function f: V (G)→{0, 1, 2,..., 2| E
(G)|− 1} such that the induced function f∗: E (G)→{1, 3,..., 2| E (G)|− 1} defined by f∗(xy)= f …

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) …