Some Results on Cordial Digraphs

• 作者: Ashraf I. Elrokh Mohammed M. Ali Al-Shamiri Shokry I. Nada Yasser Elmshtaye
• 来源期刊: 离散数学期刊(英文)
• 学科: 数学
• 关键词: PATHS Second Power of PATH JOIN of PATHS CORDIAL GRAPH
• 年，卷（期）: lssxqkyw_2020,（1）
• 页码范围: 4-12
• 页数: 9页
• 分类号: O15

摘要

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.