On some Properties of n -Tournaments
M. S. Tyagi · SIAM Journal on Applied Mathematics · 1973
Capobianco has proved that the tensor product of n digraphs is an n-tournament if and only if exactly one digraph is a tournament and all other digraphs are complete symmetric. In this paper we give necessary and sufficient conditions for an n-tournament to be strong and regular, a condition for a sequence to be the score sequence of an n-tournament and the number of pairs of non-conflicting points in any tensor product of n digraphs. Some more properties of n-tournaments are also given.