Kings in locally semicomplete digraphs |
| |
| Authors: | Ruixia Wang Aimin Yang Shiying Wang |
| |
| Institution: | School of Mathematical Sciences, Shanxi University, Taiyuan 030006, People's Republic of China |
| |
| Abstract: | 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. We consider k‐kings in locally semicomplete digraphs and mainly prove that all strong locally semicomplete digraphs which are not round decomposable contain a 2‐king. © 2009 Wiley Periodicals, Inc. J Graph Theory 63: 279–287, 2010 |
| |
| Keywords: | locally semicomplete digraphs 2‐kings round decomposable digraphs |
|
