A Novel Problem for Solving Permuted Cordial Labeling of Graphs
In this paper, we used the permutation group together with the concept of cordiality in graph theory to introduce a new method of labeling. This construed permuted cordial labeling can be applied to all paths, cycles, fans and wheel graphs. Moreover, some other properties are investigated and show t...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2023-03-01
|
| Series: | Symmetry |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2073-8994/15/4/825 |