Back
 OJDM  Vol.10 No.1 , January 2020
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.
Cite this paper: Al-Shamiri, M. , Nada, S. , Elrokh, A. and Elmshtaye, Y. (2020) Some Results on Cordial Digraphs. Open Journal of Discrete Mathematics, 10, 4-12. doi: 10.4236/ojdm.2020.101002.
References

[1]   Gallian, J.A. (2017) A Dynamic Survey of Graph Labeling. The Electronic Journal of Combinatorics, Twentieth Edition, December 22, 1-432.
https://www.combinatorics.org/ojs/index.php/eljc/article/view/DS6/versions

[2]   Harary, F. (1972) Graph Theory. Addison-Wesley Reading Mass, Massachusetts.

[3]   Diab, A.T. (2010) On Cordial Labeling of the Second Power of Paths with Other Graphs. ARS-Combinatoria, 97A, 327-343.

[4]   Cahit, I. (1987) Cordial Graphs: A Weaker Version of Graceful and Harmonious Graphs. ARS-Combinatoria, 23, 201-207.

[5]   Cahit, I. (1990) On Cordial and 3-Eqtitable Labeling of Graphs. Utilitas Mathematica, 37, 189-198.

 
 
Top