• TOTAL HOMO-CORDIAL LABELING OF GRAPHS

S. MAHESWARI*, V. THIRIPURASUNDARI

Abstract


Let G = (V, E) be a graph with p vertices and q edges. A Total Homo-Cordial Labeling of a graph G with vertex set V is a bijection from V to {0, 1} such that each uv is assigned the label 1 if f(u)=f(v) or 0 if f(u) f(v) with the condition that |evf(0)evf(1)|≤1 where evf(x) denotes the total number of vertices and edges labeled with x (x=0,1). The graph that admits a Total Homo-Cordial Labeling is called Total Homo-Cordial Graph. In this paper, we prove some graphs such as path, cycle, wheel, comp and fan are total homo- cordial labeling graphs.


Keywords


Cordial labeling, Homo-cordial labeling, Homo-cordial graph.

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 Unported License.
© 2010-2016 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
HTML Counter
Counter