A Special Study on Homo Cordial Labeling of Triangular Belt Graph
S. Sriram1, R. Govindarajan2

1S. Sriram, Assistant Professor, Department of Mathematics, Patrician College of Arts and Science, Adyar, Chennai (Tamil Nadu), India.
2Dr. R. Govindarajan, Associate Professor and Head (Retd), U.G and P.G Department of Mathematics, D.G.Vaishnav College, Arumbakkam Chennai (Tamil Nadu), India.
Manuscript received on 30 March 2019 | Revised Manuscript received on 09 April 2019 | Manuscript Published on 27 April 2019 | PP: 882-884 | Volume-7 Issue-6S2 April 2019 | Retrieval Number: F11130476S219/2019©BEIESP
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)

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 1 if f(u)=f(v) or 0 if f u f v ( ) ( )  with the condition that the number of vertices labelled with 0 and the number of vertices labelled with 1 differ by at most 1 and the number of edges labelled with 0 and the number of edges labelled with 1 differ by at most 1. The graph that admits a Homo- Cordial labelling is called Homo Cordial graph. In this paper we prove that triangular belt is Homo-Cordial labelling graph and further study on the generalization of labelling a triangular belt graph.
Keywords: Homo Cordial Graphs, Homo Cordial Labelling.
Scope of the Article: Cryptography and Applied Mathematics