Odd harmonious labeling of some cycle related graphs

17Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

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 odd harmonious graphs.

Cite

CITATION STYLE

APA

Jeyanthi, P., & Philo, S. (2016). Odd harmonious labeling of some cycle related graphs. Proyecciones, 35(1), 85–98. https://doi.org/10.4067/S0716-09172016000100006

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free