SOME REMARKS ON THE STRUCTURE OF STRONG k-TRANSITIVE DIGRAPHS
Por:
Hernandez-Cruz, C, Montellano-Ballesteros, JJ
Publicada:
1 ene 2014
Resumen:
A digraph D is k-transitive if the existence of a directed path (v(0),
v(1), ... , v(k)), of length k implies that (v(0), v(k)) is an element
of 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 k. We show that in most cases, such digraphs are
complete digraphs or cycle extensions. Also, the obtained results are
used to prove some particular cases of the Laborde-Payan-Xuong
Conjecture.
Filiaciones:
Hernandez-Cruz, C:
Univ Nacl Autonoma Mexico, Inst Matemat, Mexico City 04510, DF, Mexico
Montellano-Ballesteros, JJ:
Univ Nacl Autonoma Mexico, Inst Matemat, Mexico City 04510, DF, Mexico
|