On the exponent set of primitive locally semicomplete digraphs (Q1370296): Difference between revisions

Locally semicomplete digraphs were introduced by \textit{J. Bang-Jensen} [J. Graph Theory 14, No. 3, 371-390 (1990; Zbl 0703.05026)] as a generalization of tournaments and semicomplete digraphs. A digraph is called primitive if there exists a positive integer \(k\) such that for all ordered pairs \(u, v\) there is a walk from \(u\) to \(v\) of length \(k\). The exponent from \(u\) to \(v\) is the least integer \(\gamma\) such that there exists a walk from \(u\) to \(v\) of length \(m\) for all \(m\geq\gamma\). In this paper properties of cycles of primitive locally semicomplete digraphs are presented and the exponent sets are determined.