A novel problem and algorithm for solving permuted cordial labeling of corona product between two graphs
Résumé
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.
Citer ce document
Exporter : BibTeX · RIS (Zotero, Mendeley, EndNote)
Accès au document
Texte intégral archivé sur SPHAERO, en accès ouvert : lisible gratuitement en ligne après connexion. Le document reste aussi disponible à sa source. Se connecter
Voir l'article sur le site de la revueLicence et provenance
Licence : CC BY
Notice moissonnée depuis OpenAlex le 28/09/2026. Le document reste hébergé par sa source.
Voir le document à la source →