Abstract
In this paper we study 3-total edge product cordial (3-TEPC) labeling of some new classes of graphs. We study ladder graph, wheel graph, m isomorphic copies of n–cycle graph and dutch windmill graph in the context of 3-TEPC labeling. We also studied 3-TEPC labeling of some particular examples of graph operations like corona graphs and subdivision graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
