No Detail Found!

Existence and non existence of mean cordial labeling of certain graphs

Author(s)
R. PONRAJ Department of Mathematics, Sri Paramakalyani College, Alwarkurichi-627 412, Tamil Nadu, India
S. SATHISH NARAYANAN Department of Mathematics, Sri Paramakalyani College, Alwarkurichi-627 412, Tamil Nadu, India.
Abstract
Let f be a function from the vertex set V (G) to {0, 1, 2}. For each edge uv assign the label lf(u)+f(v) 2 m. f is called a mean cordial labeling if |vf (i) - vf (j)| _ 1 and |ef (i) - ef (j)| _ 1, i, j 2 {0, 1, 2}, where vf (x) and ef (x) respectively denote the number of vertices and edges labeled with x (x = 0, 1, 2). A graph with a mean cordial labeling is called a mean cordial graph. In this paper we investigate mean cordial labeling behavior of prism, K2+Km, Kn+2K2, book Bm and some snake graphs.
Publication Details
Page(s) 123-136
DOI DOI not available
Published Journal: Journal of Prime Research in Mathematics, Volume: 11, Issue: 1, Year: 2015

Request the full text from PASTIC

Keywords
Corona, Path, Complete Graph, 05C78, AMS SUBJECT, prism, flower graph
References
Albert William .2013 .Indra Rajasingh and Roy, Mean cordial labeling of certain graphs. J. Comp & Math. Sci., 4 : 274-281.
Harary F. . .. , : .
Gallian J. A. .2011 .. The Electronic Journal of Combinatorics, 18 : DS6.
Ponraj R.,Sivkumar M.,Sundaram M. .2012 .Mean cordial labeling of graphs. Open Journal of Discreate Mathematics, 4 : 145-148.
Ponraj R.,Sivakumar M. .2013 .. International Journal of Mathematical Combinatorics, 3 : 78-84.
Ponraj R.,Sathish S.,Narayanan S. .2015 .Mean cordiality of some snake graphs. Palestine Journal of Mathematics, 4(2) : 439-445.
0

Citations

0

Downloads

74

Views