• EXTENDED VERTEX EDGE EQUITABLE LABELING (EVEEL) A NEW METHOD OF GRAPH LABELING

Abstract

We define a new type of labeling called as Extended Vertex Edge Equitable Labeling (eveel) of graphs. We allow the vertices to take values from {0,1,-1} and obtain the edge label as the absolute difference between the labels of the incident vertices. We show that K_1,n, Cn is eveel except for n≡3 (mod 6) and non  isomorphic  structures of one point union of Flag of C₃ are evee graphs.