Author(s)

Mohammed M. Ali Al-Shamiri^1,2, Shokry I. Nada³, Ashraf I. Elrokh³, Yasser Elmshtaye¹

¹Department of Mathematics, Faculty of Science and Arts, Mohayel Assir, King Khalid University, Abha, KSA.
²Department of Mathematics and Computer, Faculty of Science, Ibb University, Ibb, Yemen.
³Department of Mathematics, Faculty of Science, Munofia University, Monofia, Egypt.

A digraph is a graph in which each edge has an orientation. A linear directed path, , is a path whose all edges have the same orientation. A linear simple graph is called directed cordial if it admits 0 - 1 labeling that satisfies certain condition. In this paper, we study the cordiality of directed paths  and their second power . Similar studies are done for  and the join  . We show that ,  and  are directed cordial. Sufficient conditions are given to the join   to be directed cordial.

Paths, Second Power of Path, Join of Paths, Cordial Graph

Al-Shamiri, M. , Nada, S. , Elrokh, A. and Elmshtaye, Y. (2020) Some Results on Cordial Digraphs. Open Journal of Discrete Mathematics, 10, 4-12. doi: 10.4236/ojdm.2020.101002.