• EXTENDED EDGE VERTEX CORDIAL LABELING OF GRAPH

Abstract

A binary labeling that assigns 0 or 1 to each vertex of a graph with certain condition called as pairity condition is called as vertex binary labeling. Here we discuss a labeling  that give some natural numbers as labels to edges but results in binary labeling of vertices. This graph labeling is called as extended edge vertex cordial (eevc) labeling and we show that path Pn, Cycles C_n, K_1,n, K₂,n,snskes on C3 i.e. S(C3,n) have eevc labeling.