|
|
 |
| |
|
|
|
The Cordiality for the Join of Pairs of the Third Power of Paths |
|
|
|
PP: 611-615 |
|
|
|
doi:10.18576/amis/160414
|
|
|
|
Author(s) |
|
|
|
E. A. Elsakhawy,
|
|
|
|
Abstract |
|
|
| A graph is said to be cordial if it has a 0−1 labeling that satisfies certain properties. The third power of path P3, is the graph n
obtained from the path Pn by adding edges that join all vertices and with d ≤ 3. In this paper, we show that Pn3 is cordial if and only if n ̸= 4. Moreover, we study the cordiality for the sum of pairs of the third power of paths.
Keywords: |
|
|
|
|
|
|
|
