Intersection cordiality of union of some standard graphs

An intersection cordial labeling of a graph G with vertex set V is an injection f from V to the power set of {1, 2, ..., n} such that if each edge uv is assigned the label 1 if f(u) boolean AND f(v) not equal empty set and 0 otherwise; Then the number of edges labeled with 0 and the number of edges labeled with 1 differ by at most 1. If a graph has an intersection cordial labeling, then it is called intersection cordial graph. In this paper, we are going to check whether the graphs 2(k)P(2n), 2(k)C(2n), 2(k)K(1,2n-1) and 2(k)K(2,2n-2) are intersection cordial or not.