PC-Labeling of a Graph and its PC-Set
Ebrahim Salehi · 2010
A binary vertex labeling f : V (G) !Z2 of a graph G is said to be friendly if the number of vertices labeled 0 is almost the same as the number of vertices labeled 1: This friendly labeling induces an edge labeling f ⁄ : E(G) !Z2 deflned by f ⁄ (uv) = f(u)f(v) for all uv 2 E(G): Let ef(i) = fuv 2 E(G) : f ⁄ (uv) = ig be the number of edges of G that are labeled i: Productcordial index of the labeling f is the number pc(f) = jef(0)ief(1)j: The product-cordial set of the graph G, denoted by PC(G); is deflned by PC(G) = fpc(f) : f is a friendly labeling of G g: In this paper we will determine the product-cordial sets of certain classes of graphs.