The radii of n-partite tournaments (Q582300)

Oriented graphs obtained from complete n-partite graphs (respectively, from complete multigraphs or complete graphs), with orientation of all the edges, are called n-partite tournaments (respectively, complete orgraphs or tournaments). n-partite tournaments were first studied as a generalization of tournaments by \textit{J. W. Moon} [see ''Topics in tournaments'' (1968; Zbl 0191.227)]. While tournaments are used for the method of pairwise comparison, with applications in biology and sociology, n-partite tournaments occur in the method of command comparison. Several results are obtained on ''long'' paths and contours in n-partite tournaments. We shall now consider ''shot'' paths in n-partite tournaments. Moreover, we shall obtain a characterization of c-partite tournaments of finite radius, and we shall give an exact estimate of the radius of such orgraphs.