The Cordiality for the Join of Pairs of the Third Power of Paths

Authors

E. A. Elsakhawy, Department of Mathematics Faculty of Science, Ain Shams University, Abbassia, Cairo, EgyptFollow

Author Country (or Countries)

Egypt

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:

Digital Object Identifier (DOI)

http://dx.doi.org/10.18576/amis/160414

Recommended Citation

A. Elsakhawy, E. (2022) "The Cordiality for the Join of Pairs of the Third Power of Paths," Applied Mathematics & Information Sciences: Vol. 16: Iss. 4, Article 14.
DOI: http://dx.doi.org/10.18576/amis/160414
Available at: https://digitalcommons.aaru.edu.jo/amis/vol16/iss4/14