Some Results on Cordial Digraphs

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 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.