Kings in Hypertournaments—Survey
Dejan Brcanov, Vojislav Petrović, Miroslav Treml, Theodore E. Simos, George Psihoyios, Ch. Tsitouras · AIP conference proceedings · 2010
A vertex ν is an s‐king of an hypertournament T if the distance from ν to every other vertex of T is at most s. We consider 1‐kings and 2‐kings of hypertournaments. In some properties they follow corresponding kings of ordinary tournaments. In some other they are completely different.