• SUM CORDIAL LABELING FOR SOME GRAPHS

J. SHIAMA*

Abstract


In this paper I investigate a new labeling called the Sum Cordial labeling and some Sum Cordial graphs. A binary vertex labeling of a graph G with induced edge labeling f* : E(G) → {0,1} defined by f*(uv) =  (f(u) + f(v) ) (mod2) is called a sum cordial labeling if   |vf(0) -vf(1)|≤ 1 and |ef(0) -ef(1)|≤ 1.Any graph which satisfies the sum cordial labeling is called a Sum Cordial graph. Here I prove some graphs like path Pn, cycle Cn , star K1,n , bistar  Bn,n and  the graphs obtained by joining apex vertices of k copies of double stars to a new vertex  are Sum cordial graphs.


Keywords


Sum cordial labeling, Sum Cordial graphs,

Full Text:

PDF


Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA)
Copyright Agreement & Authorship Responsibility
Web Counter