Some Results on Cordial Digraphs

作     者：Mohammed M. Ali Al-Shamiri 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 

出 版 物：《Open Journal of Discrete Mathematics》 (离散数学期刊（英文）)

年 卷 期：2020年第10卷第1期

页      面：4-12页

学科分类：07[理学] 0701[理学-数学] 070101[理学-基础数学] 

主　　题：Paths Second Power of Path Join of Paths Cordial Graph 

摘      要：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.