Some Remarks On The Structure Of Strong K-Transitive Digraphs
César Hernández-Cruz, Juan José Montellano-Ballesteros (2014)
Discussiones Mathematicae Graph Theory
Similarity:
A digraph D is k-transitive if the existence of a directed path (v0, v1, . . . , vk), of length k implies that (v0, vk) ∈ A(D). Clearly, a 2-transitive digraph is a transitive digraph in the usual sense. Transitive digraphs have been characterized as compositions of complete digraphs on an acyclic transitive digraph. Also, strong 3 and 4-transitive digraphs have been characterized. In this work we analyze the structure of strong k-transitive digraphs having a cycle of length at least...