• 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 (C5, P2), tail (C5,P3), tail(C5,2p2), tail(C5,P4), tail(C5, P2, P3), tail(C5,3P2) and also have split tail Pk 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.
Keywords
tail, cordial, one point union, fusion of vertex, structures, isomorphism.
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2024 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |