Kings and Kernels in Semicomplete Compositions

Yuefang Sun, Zemin Jin

Let $k$ be an integer with $k\ge 2$. A $k$-king in a digraph $D$ is a vertex which can reach every other vertex by a directed path of length at most $k$ and a non-king is a vertex…