Просмотр кода страницы Semicomplete c-partite digraph

'''Semicomplete <math>c</math>-partite digraph''' --- полуполный <math>c</math>-дольный
орграф. 

A ''' semicomplete <math>c</math>-partite digraph''' is a digraph obtained from a complete <math>c</math>-partite
graph by substituting each edge with an arc, or pair of mutually
opposite arcs with the same end vertices. A '''semicomplete multipartite digraph (SMD)''' is a semicomplete <math>c</math>-partite digraph with
<math>c \geq 2</math>. Special cases of SMD's are semicomplete bipartite digraphs
(<math>c = 2</math>) and semicomplete digraphs (<math>c = n</math>, the number of vertices).
A <math>c</math>-partite tournament is a semicomplete <math>c</math>-partite digraph with no
cycles of length 2, and, analogously, a multipartite tournament (MT) is
a SMD wih no cycles of length 2.