Characterization of (m, 1)-transitive an
✍
Zsolt Tuza
📂
Article
📅
1994
🏛
Elsevier Science
🌐
English
⚖ 875 KB
A directed graph is called (m, k)-transitive if for every directed path x0x1 . ..x. there is a directed path y,y, . ..yt such that x0 =y ,,, x,=yl,, and {yiIO<iik}c{xiIO<i<m}. We describe the structure of those (m, 1)-transitive and (3,2)-transitive directed graphs in which each pair of vertices is