• EXTENDED EDGE VERTEX CORDIAL LABELING OF GRAPH

MUKUND V. BAPAT*

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 Cn, K1,n, K2,n,snskes on C3 i.e. S(C3,n) have eevc labeling.


Keywords


edge, vertex, cordial, graph, wheel, path, label.

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
Web Counter