%0 Journal Article
%T Some Results on Cordial Digraphs
%A Mohammed M. Ali Al-Shamiri
%A Shokry I. Nada
%A Ashraf I. Elrokh
%A Yasser Elmshtaye
%J Open Journal of Discrete Mathematics
%P 4-12
%@ 2161-7643
%D 2020
%I Scientific Research Publishing
%R 10.4236/ojdm.2020.101002
%X A digraph is a graph in which each edge has an orientation. A linear directed path, <sub><img src=\"Edit_667755d6-7b9f-40cc-a7a4-efba978d494a.bmp\" width=\"15\" height=\"21\" alt=\"\" /></sub>, 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&nbsp;<sub><img src=\"Edit_667755d6-7b9f-40cc-a7a4-efba978d494a.bmp\" width=\"15\" height=\"21\" alt=\"\" style=\"font-size:10px;white-space:normal;\" />&nbsp;</sub>and their second power <sub><img src=\"Edit_165dd9bd-2294-41a7-addc-e2ee2a3d8923.bmp\" width=\"18\" height=\"22\" alt=\"\" /></sub> . Similar studies are done for <sub><img src=\"Edit_2699834e-3f0a-49f2-895f-94e38d731b34.bmp\" width=\"35\" height=\"26\" alt=\"\" /></sub>&nbsp;and the join <sub><img src=\"Edit_b2e4e1d2-1c5c-4637-b77a-32705b07a255.bmp\" width=\"35\" height=\"26\" alt=\"\" /></sub>&nbsp;. We show that <sub><img src=\"Edit_667755d6-7b9f-40cc-a7a4-efba978d494a.bmp\" width=\"15\" height=\"21\" alt=\"\" style=\"font-size:10px;white-space:normal;\" /></sub> ,&nbsp;<sub><img src=\"Edit_165dd9bd-2294-41a7-addc-e2ee2a3d8923.bmp\" width=\"18\" height=\"22\" alt=\"\" style=\"font-size:10px;white-space:normal;\" /></sub> and <sub><img src=\"Edit_2699834e-3f0a-49f2-895f-94e38d731b34.bmp\" width=\"35\" height=\"26\" alt=\"\" style=\"font-size:10px;white-space:normal;\" /></sub>&nbsp;are directed cordial. Sufficient conditions are given to the join&nbsp;<sub><img src=\"Edit_b2e4e1d2-1c5c-4637-b77a-32705b07a255.bmp\" width=\"35\" height=\"26\" alt=\"\" style=\"font-size:10px;white-space:normal;\" /></sub>&nbsp; to be directed cordial.
%K Paths
%K Second Power of Path
%K Join of Paths
%K Cordial Graph
%U http://www.scirp.org/journal/PaperInformation.aspx?PaperID=96997