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.