On k-Transitive Closures of Directed Paths


In this paper we study the structure of k-transitive closures of directed paths and formulate several properties. Concept of k-transitive orientation generalizes the traditional concept of transitive orientation of a graph.

Share and Cite:

Pszczoła, K. (2015) On k-Transitive Closures of Directed Paths. Advances in Pure Mathematics, 5, 733-737. doi: 10.4236/apm.2015.512066.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] Kelly, D. (1985) Comparability Graphs. In: Rival, I., Ed., Graphs and Order. The Role of Graphs in the Theory of Ordered Sets and Its Applications, North Holland, Dordrecht, 3-40.
[2] Gyárfás, A., Jacobson, M.S. and Kinch, L.F. (1988) On a Generalization of Transitivity for Digraphs. Discrete Mathematics, 69, 35-41.
[3] Tuza, Z. (1994) Characterization of (m,1)-Transitive and (3,2)-Transitive Semi-Complete Directed Graphs. Discrete Mathematics, 135, 335-347.
[4] Hernández-Cruz, C. (2012) 3-Transitive Digraphs. Discussiones Mathematicae Graph Theory, 32, 205-219.
[5] Hernández-Cruz, C. and Montellano-Ballesteros, J.J. (2014) Some Remarks on the Structure of Strong k-Transitive Digraphs. Discussiones Mathematicae Graph Theory, 34, 651-671.

Copyright © 2020 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.