• TOTAL HOMO-CORDIAL LABELING OF GRAPHS

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 |ev_f(0)−ev_f(1)|≤1 where ev_f(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.