TITLE:
Some Results on Cordial Digraphs
AUTHORS:
Mohammed M. Ali Al-Shamiri, Shokry I. Nada, Ashraf I. Elrokh, Yasser Elmshtaye
KEYWORDS:
Paths, Second Power of Path, Join of Paths, Cordial Graph
JOURNAL NAME:
Open Journal of Discrete Mathematics,
Vol.10 No.1,
December
10,
2019
ABSTRACT: 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 pathsand 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.