Research ArticleOpen AccessGoogle Scholar indexed
Mean Cordial Labeling of Graphs
Department of Mathematics, Sri Paramakalyani College, Alwarkurchi, India
Department of Mathematics, Unnamalai Institute of Technology, Kovilpatti, India
Department of Mathematics, Sri Paramakalyani College, Alwarkurchi, India
- 1 Department of Mathematics, Sri Paramakalyani College, Alwarkurchi, India
- 2 Department of Mathematics, Unnamalai Institute of Technology, Kovilpatti, India
- 3 Department of Mathematics, Sri Paramakalyani College, Alwarkurchi, India
Open Journal of Discrete Mathematics·Volume 02 (2012)·Pages 145–148·Published 31 October 2012·DOI10.4236/ojdm.2012.24029
Copy link · social · email
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.
KeywordsPathStarComplete GraphComb
- J. A. Gallian, “A Dynamic Survey of Graph Labeling,” Electronic Journal of Combinatorics, Vol. 18, 2011, pp. 1-219..
- I. Cahit, “Cordial Graphs: A Weaker Version of Graceful and Harmonious Graphs,” Ars Combinatoria, Vol. 23, No. 3, 1987, pp. 201-207.
- 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.
- F. Harary, “Graph Theory,” Addision Wisely, New Delhi, 1969.