Difference cordial labeling of corona graphs
Abstract
Let G be a (p,q) graph. Let f be a map from V (G) to {1,2,...,p}. For each edge xy, assign the label |f (x) − f (y)|. f is called a difference cordial labeling if f is a one to one map and |ef(0) − ef(1)| ≤ 1 where ef(1) and ef(0) denote the number of edges labeled with 1 and not labeled with 1 respectively. A graph with a difference cordial labeling is called a difference cordial graph. In this paper, we investigate the difference cordial labeling behavior of G⊙Pn, G⊙mK1 (m = 1,2,3) where G is either a unicycle or a tree and G1⊙ G2where G1and G2are some more standard graphs.
Copyright © 2013 R. Ponraj, S. Sathish Narayanan, R. Kala. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Cite this article
R. Ponraj, S. S. Narayanan, R. Kala, Difference cordial labeling of corona graphs, J. Math. Comput. Sci. 3 (2013), 1237–1251.
BibTeX
@article{Ponraj2013,
author = {Ponraj, R. and Narayanan, S. Sathish and Kala, R.},
title = {Difference cordial labeling of corona graphs},
journal = {J. Math. Comput. Sci.},
volume = {3},
year = {2013},
pages = {1237--1251},
doi = {}
}