• ONE POINT UNION OF TAIL GRAPHS FOR CORDIAL LABELING AND INVARIANCE

Abstract

One point union of k copies of graph G i.e. G^(k) are obtained by fusing k copies of G at the same fixed point on G. If we change this point of fusion we may get different structures up to isomorphism. We have taken G = tail (C₅, P₂), tail (C₅,P₃), tail(C₅,2p₂), tail(C₅,P₄), tail(C₅, P₂, P₃), tail(C₅,3P₂) and also have split tail P_k in sub tails of shorter length whose sum will be k-1 edges. We obtained all possible structures on G^(k). We show that all these structures are cordial.