Please use this identifier to cite or link to this item:
https://open.uns.ac.rs/handle/123456789/29062
Title: | Kings in Hypertournaments | Authors: | Brcanov, Dejan Petrović, Vojislav Treml Miroslav |
Issue Date: | 2013 | Journal: | Graphs and Combinatorics | Abstract: | A vertex v is an s-king (s ≥ 1) of an hypertournament T if the distance from v to every vertex of T is at most s. We show that Landau's theorem for 2-kings of ordinary tournaments also holds in hypertournaments. Possible distributions of 1-kings and 2-kings in hypertournaments are considered. © 2012 Springer. | URI: | https://open.uns.ac.rs/handle/123456789/29062 | ISSN: | 0911-0119 | DOI: | 10.1007/s00373-012-1131-9 |
Appears in Collections: | PMF Publikacije/Publications |
Show full item record
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.