E-Cordiality Of Tail C4related One Point Union Graphs

In this paper we obtain e-cordial labeling of one point union of k copies of tail graph namely G(k) where G = tail C4(Pt). We have taken different values of t as 2,3,4. If we change point of union on G then different structures of G(k) are obtained. Of these we have taken pairwise non isomorphic structures of G(k) and have proved that they all are e-cordial under certain conditions. We have also considered the case that more than one tails are attached to G such that sum of edges is t-1 for given t as above and the family is e-cordial.