Some Remarks On The Structure Of Strong K-Transitive Digraphs

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

Full description

Bibliographic Details
Main Authors: Hernández-Cruz César, Montellano-Ballesteros Juan José
Format: Article
Language:English
Published: Sciendo 2014-11-01
Series:Discussiones Mathematicae Graph Theory
Subjects:
Online Access:https://doi.org/10.7151/dmgt.1765