## NEW RESULTS ON ODD HARMONIOUS LABELING OF GRAPHS

## NEW RESULTS ON ODD HARMONIOUS LABELING OF GRAPHS

*P. Jeyanthi, S. Philo*

[**PDF**]

## Abstract

Let G = (V;E) be a graph with p vertices and q edges. A graph G is said to be odd harmonious if there exists an injection f : V (G) ! f0; 1; 2; ; 2q 1gsuch that the induced function f : E(G) ! f1; 3; ; 2q 1g de ned by f (uv) = f(u) + f(v) is a bijection. If f(V (G)) = f0; 1; 2; ; qg then f is called strongly odd harmonious labeling and the graph is called strongly odd harmonious graph. In this paper we prove that Spl(Cbn) and Spl(B(m)(n)), slanting ladder SLn, mGn, H-super subdivision of path Pn and cycle Cn, n 0(mod 4) admit odd harmonious labeling. In addition we observe that all strongly odd harmonious graphs admit mean labeling, odd mean labeling, odd sequential labeling and all odd sequential graphs are odd harmonious and all odd harmonious graphs are even sequential harmonious.

## Keywords

Odd harmonious labeling; Strongly odd harmonious labeling; Odd sequential labeling; Even sequential harmonious labeling; Mean labeling; Odd mean labeling.