International Journal of Multidisciplinary Research and Development

International Journal of Multidisciplinary Research and Development


International Journal of Multidisciplinary Research and Development
International Journal of Multidisciplinary Research and Development
Vol. 2, Issue 10 (2015)

Cycle Related Homo-Cordial Graphs


A. Nellai Murugam, A. Mathubala

Let G = (V,E) be a graph with p vertices and q edges. A Homo-Cordial Labeling of a Graph G with vertex set V is a bijection from V to {0, 1} such that each edge uv is assigned the label 1if f (u) =f (v) or 0 if f (u) ? f (v) with the condition that the number of vertices labeled with 0 and the number of vertices labeled with 1 differ by atmost 1 and the number of edges labeled with 0 and the number of edges labeled with 1 differ by atmost 1. The graph that admits a Homo-Cordial Labeling (HoCL) is called Homo-Cordial Graph (HoCG). In this paper, we proved that Cycle related graphs Cycle Cn(n-odd), Double triangular snake C2(Pn), D2(Cn), Globe Gl(n), Crown Cn?K1 are Homo-Cordial Graphs.
Download  |  Pages : 84-88
How to cite this article:
A. Nellai Murugam, A. Mathubala. Cycle Related Homo-Cordial Graphs. International Journal of Multidisciplinary Research and Development, Volume 2, Issue 10, 2015, Pages 84-88
International Journal of Multidisciplinary Research and Development