| |
|
|
|
Exploring a New Challenge in Permuted Cordial Labeling of the Corona Product of Two Distinct Graphs |
|
|
|
PP: 761-767 |
|
|
|
doi:10.18576/amis/190403
|
|
|
|
Author(s) |
|
|
|
Ashraf Elrokh,
Khalid A. Alsatami,
Mohamed A. Nouh,
Yasmin Algrawani,
|
|
|
|
Abstract |
|
|
| A graph is said to be Permuted cordial labeling if it has a I, f,g labeling that satisfies certain properties. In this paper, we present a novel application of permuted cordial labeling based on the corona product of two graphs, demonstrating its potential for understanding and studying specific graph structures. The resulting Permuted cordial labeling scheme for the corona product of paths, cycles, second power of paths, cycles Fans , and wheels may provide consideration for the graphs’s properties and structures. We can use it to investigate its connectivity, symmetry, and other graph-theoretic properties. |
|
|
|
|
 |
|
