Let G=(V,E) be a graph with p vertices and q edges. A graph G is said to be a prime mean cordial labeling if there exists an injective function f:V(G)→{0,1,2,…,q} such that the induced edge labeling f^*:E(G)→{0,1} defined by f^* (uv)={█(1 if ⌈(f(u)+f(v))/2⌉is odd@0 otherwise )┤ satisfying the condition that for every v∈V(G) with deg(v)≥1, S_v=∑▒〖{f^* (e=uv)/uv∈E(G)}〗 is 1 or prime and |e_f (i)-e_f (j)|≤1,i,j∈{0,1} where e_f (x) denotes the number of edges labeled with x. . A graph with prime mean cordial labeling is called prime mean cordial graph. In this paper prime mean cordiality of some graphs are discussed.