Biconditional cordial labeling of cycle related graphs

摘要

Let G = (V, E) be a graph. A function f: V → {0, 1} of the graph G is called a Biconditional cordial labeling of G if an induced edge function f~*: E → {0, 1} defined by f~*(uv)={1, if f(u)=f(v) satisfies the following two conditions. 0, if f(u) ≠ f(v) satisfies the following two conditions. i) |v_f(0)-v_f(1)|≤ 1 ii) |e_(f~*)(0)-e_(f~*)(1)|≤ 1 In this manuscript, we prove the existence of the Biconditional cordial labeling for complete bipartite graph, book graph with triangular pages, sunflower graph and web graph.