• CORDIAL AND PRODUCT CORDIAL LABELING FOR THE EXTENDED DUPLICATE GRAPH OF SPLITTING GRAPH OF PATH
Abstract
In this paper, we prove that the extended duplicate graph of splitting graph of path admits cordial, total cordial, product cordial and total product cordial labeling.
Keywords
Graph labeling, Duplicate graph, Splitting graph, Cordial labeling, Product cordial labeling.
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 |