Facebook Instagram Twitter RSS Feed PodBean Back to top on side

Kings and serfs in oriented graphs

In: Mathematica Slovaca, vol. 58, no. 3
S. Pirzada - Ekta Shah

Details:

Year, pages: 2008, 277 - 288
Keywords:
tournament, oriented graph, transmitter, king, serf, score
About article:
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.
How to cite:
ISO 690:
Pirzada, S., Shah, E. 2008. Kings and serfs in oriented graphs. In Mathematica Slovaca, vol. 58, no.3, pp. 277-288. 0139-9918.

APA:
Pirzada, S., Shah, E. (2008). Kings and serfs in oriented graphs. Mathematica Slovaca, 58(3), 277-288. 0139-9918.