OJDM> Vol.2 No.4, October 2012

Mean Cordial Labeling of Graphs

DownloadDownload as PDF (Size:156KB) Full-Text HTML PP. 145-148   DOI: 10.4236/ojdm.2012.24029

ABSTRACT

Let f be a map from V(G) to . For each edge uv assign the label . f is called a mean cordial la- beling if and , , where and denote the number of vertices and edges respectively labelled with x ( ). A graph with a mean cordial labeling is called a mean cor- dial graph. We investigate mean cordial labeling behavior of Paths, Cycles, Stars, Complete graphs, Combs and some more standard graphs.

KEYWORDS


Cite this paper

R. Ponraj, M. Sivakumar and M. Sundaram, "Mean Cordial Labeling of Graphs," Open Journal of Discrete Mathematics, Vol. 2 No. 4, 2012, pp. 145-148. doi: 10.4236/ojdm.2012.24029.

References

[1] J. A. Gallian, “A Dynamic Survey of Graph Labeling,” Electronic Journal of Combinatorics, Vol. 18, 2011, pp. 1-219..
[2] I. Cahit, “Cordial Graphs: A Weaker Version of Graceful and Harmonious Graphs,” Ars Combinatoria, Vol. 23, No. 3, 1987, pp. 201-207.
[3] M. Sundaram, R. Ponraj and S. Somosundram, “Product Cordial Labeling of Graph,” Bulletin of Pure and Applied Sciences, Vol. 23, No. 1, 2004, pp. 155-162.
[4] F. Harary, “Graph Theory,” Addision Wisely, New Delhi, 1969.

comments powered by Disqus

Copyright © 2014 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.