Kings in Multipartite Tournaments And Hypertournaments
Dejan Brcanov, Vojislav Petrović, Theodore E. Simos, George Psihoyios, Ch. Tsitouras · AIP conference proceedings · 2009
A vertex v is an s‐king of a digraph D if the distance from v to every other vertex of D is at most s. We discuss various questions concerning s‐kings in multipartite tournaments and hypertournaments for s = 1, 2, 3, 4.