On the bounded domination number of tournaments
A star of degree \(t\) in a digraph \(D\) is a union of \(t\) arcs that lead away from the same node. The \(k\)-domination number \(\gamma_k(D)\) of \(D\) is the minimum number of stars of degree at most \(k\) needed to cover the nodes of \(D\). The authors show, among other things, that if \(T\) is a tournament with \(n\) nodes, where \(n\geq 14 k\log_2k\), then \(\gamma_k(T)= \lceil n/(k+ 1)\rceil\).
scientific article; zbMATH DE number 1462288