| |
|
|
|
On Cordial Labeling of Third Power of Path with Other Graphs |
|
|
|
PP: 1195-1207 |
|
|
|
doi:10.18576/amis/180603
|
|
|
|
Author(s) |
|
|
|
E. A. Elsakhawy,
Adel T. Diab,
|
|
|
|
Abstract |
|
|
| If a graph’s 0 − 1 labeling meets specific criteria, it is referred to as cordial. The graph that is produced from the path Pn by adding edges that connect each vertex u and v with d(u,v) = 3 is known as the third power of paths P3. In this work, we examine the
cordiality of the join and the union of graphs with one path and one cycle, as well as the third power of paths. |
|
|
|
|
 |
|
