Semicomplete digraph
Материал из WikiGrapp
Semicomplete digraph --- полуполный орграф.
If each partite set in a semicomplete [math]\displaystyle{ c }[/math]-partite digraph consists of a single vertex, then such a digraph is called a semicomplete digraph.
