A novel problem and algorithm for solving permuted cordial labeling of corona product between two graphs

Abstract

This study has come up with a new application of permuted cordial labeling initiated by two graphs based on their corona product, furthering the cause of a better comprehension of and research into specific types of graphs. The Permuted cordial labeling construction for the corona product of graphs consisting of paths, cycles, second power of a path and second power of cycle graphs may facilitate the consideration of the properties and structures of the graphs. It helps us to study its topological properties, connectivity images, symmetries and other properties.