International Journal of Multidisciplinary Research and Development

International Journal of Multidisciplinary Research and Development

Online ISSN: 2349-4182
Print ISSN: 2349-5979

Vol. 2, Issue 10 (2015)

Cycle Related Homo-Cordial Graphs

Author(s): A. Nellai Murugam, A. Mathubala
Abstract: 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.
Pages: 84-88  |  1082 Views  500 Downloads
Journals List Click Here Research Journals Research Journals