International Journal of Mathematics and Soft Computing Vol.1, No.1 (2011), 105 - 114 105 ISSN 2249 – 3328 Cordial labeling for the splitting graph of some standard graphs P. Lawrence Rozario Raj Department of Mathematics, St. Joseph’s College Trichirappalli – 620 002, Tamil Nadu, India. E-mail: lawraj2006@yahoo.co.in S. Koilraj Department of Mathematics, St. Joseph’s College Trichirappalli – 620 002, Tamil Nadu, India. E-mail: skoilraj@yahoo.com Abstract In this paper we prove that the splitting graph of path P n , cycle C n , complete bipartite graph K m,n , matching M n , wheel W n and   (k) n 1, (2) n 1, (1) n 1, K : ... : K : K are cordial. Key words: Cordial labeling, Splitting graph. AMS Subject Classification (2010): 05C78. 1 Introduction All graphs considered here are finite, simple and undirected. The origin of graph labelings can be attributed to Rosa [7]. For all terminologies and notations we follow Harary [5]. Following definitions are useful for the present study. Definition 1.1. [8] For each vertex v of a graph G, take a new vertex v. Join v to all the vertices of G adjacent to v. The graph S(G) thus obtained is called splitting graph of G. Definition 1.2. [9] The graph G =   (k) ,n ) ( ,n ) ( ,n :...:K :K K 1 2 1 1 1 is obtained from k copies of stars (k) ,n ) ( ,n ) ( ,n ,...,K ,K K 1 2 1 1 1 by joining apex vertices of each ) (p ,n K 1 1  and (p) ,n K 1 to a new vertex x p–1 ,2  p  k. Note that G has k(n + 2) − 1 vertices and k(n + 2) − 2 edges.