A Novel Problem and Algorithm for Solving Cordial Labeling of Some Fifth Powers of Graphs
DOI:
https://doi.org/10.29020/nybg.ejpam.v18i1.5812Keywords:
Cordial labeling, Fifth power, lemniscateAbstract
In this paper we introduce a novel application of cordial labeling using the fifth power of graphs, demonstrating its potential for understanding and studying specific graph structures. The resulting cordial labeling scheme for the fifth power of paths, cycles, fans, wheels, lemniscate and the union of fifth power of paths and cycles graphs can provide insights into the properties and structures of these graphs. It can be used to analyze its connectivity, symmetry, and other graph-theoretical characteristics.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Atef Abd El-hay, Khalid A. Alsatami, Ashraf Elrokh
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.
By agreeing to this statement, you acknowledge that:
- You retain full copyright over your work.
- The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
- This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.