COMPLEX COMPOSITION CORDIAL LABELING OF COMB AND BI-STAR GRAPH

Let be any abelian group. A graph G= (V(G), E(G)) is said to be A-cordial if there is a mapping f:V(G)→A which satisfies the following two conditions with each edge e = uv is labeled as f*(uv) = f(u)*f(v) • |
() −
() | ≤ 1 ∀a, b ∈ A • | () − () | ≤ 1 ∀a, b ∈ A Where
()= the number of vertices with label a
()= the number of vertices with label b ()= the number of edges with label a ()= the number of edges with label b In [3], V4-cordial labeling is defined. It mooted me an idea to define CCCL as follows. We have defined a set ₵={, , , } where =z, =-z,=1/z,=-1/z ∀ z ∈C−{0} is an abelian group and under binary operation * is defined as * = ∘ =( ). We note that if A= is a multiplicative group. Then the labeling is known as Complex Composition Cordial Labeling, and in short denoted as CCCL. A graph which admits CCCL is called as Complex Composition Cordial Graph, which is denoted as CCCG. In thi