Kings and serfs in oriented graphs

Mathematica Slovaca

N. Shah¹  S. Pirzada¹ 

关键词: tournament;    oriented graph;    transmitter;    king;    serf;    score;   

DOI  :  10.2478/s12175-008-0073-4

学科分类：数学（综合）

来源: Slovenska Akademia Vied * Matematicky Ustav / Slovak Academy of Sciences, Mathematical Institute

【 摘 要 】

In this paper, we extend the concept of kings and serfs in tournaments to that of weak kings and weak serfs in oriented graphs. We obtain various results on the existence of weak kings (weak serfs) in oriented graphs, and show the existence of n-oriented graphs containing exactly k weak kings (weak serfs), 1 ≤ k ≤ n. Also, we give the existence of n-oriented graphs containing exactly k weak kings and exactly s weak serfs such that b weak kings from k are also weak serfs.

【 授权许可】

Unknown