A Special Research on Homo Cordial Labeling of Spider Graph
S.Sriram1, R.Govindarajan2
1S.Sriram, Assistant Professor, Department of Mathematics, Patrician College of Arts and Science, Adyar,Chennai-20, India.
2Dr.R.Govindarajan, Associate Professor and Head (Retd.), P.G and U.G, Department of Mathematics, D.G.Vaishnav College, Arumbakkam, Chennai,India
Manuscript received on 02 October 2019 | Revised Manuscript received on 13 October 2019 | Manuscript Published on 29 June 2020 | PP: 217-221 | Volume-8 Issue-10S2 August 2019 | Retrieval Number: J103708810S19/2019©BEIESP | DOI: 10.35940/ijitee.J1037.08810S19
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 the spider graph SP(1m,2t) is Homo-Cordial labelling graph and further study on the generalisation of labelling spider graph SP(1m,2t).
Keywords: Homo Cordial Graphs, Homo Cordial Labelling.
Scope of the Article: Applied Mathematics and Mechanics