A Novel Problem and Algorithm for Solving Cordial Labeling of Some Fifth Powers of Graphs

Authors

  • Atef Abd El-hay Mathematics and Computer Science Department, Faculty of Science Menoufia University, Menoufia, Egypt https://orcid.org/0000-0002-2793-5688
  • Khalid A. Alsatami Department of Mathematics, College of Science, Qassim University, Buraydah, KSA
  • Ashraf Elrokh Mathematics and Computer Science Department, Faculty of Science Menoufia University, Menoufia, Egypt https://orcid.org/0000-0002-4889-255X

DOI:

https://doi.org/10.29020/nybg.ejpam.v18i1.5812

Keywords:

Cordial labeling, Fifth power, lemniscate

Abstract

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

2025-02-01

Issue

Section

Nonlinear Analysis

How to Cite

A Novel Problem and Algorithm for Solving Cordial Labeling of Some Fifth Powers of Graphs. (2025). European Journal of Pure and Applied Mathematics, 18(1), 5812. https://doi.org/10.29020/nybg.ejpam.v18i1.5812