Kings and serfs in oriented graphs

Simple item page
dc.creatorPirzada, S.
dc.creatorShah, N. A.
dc.date2006-09-07
dc.date.accessioned2026-07-07T07:24:36Z
dc.date.available2026-07-07T07:24:36Z
dc.descriptionIn 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). 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.
dc.identifierhttps://arxiv.org/abs/math/0609203
dc.identifierhttp://arxiv.org/abs/math/0609203
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116420
dc.subjectCombinatorics
dc.subject05C
dc.titleKings and serfs in oriented graphs
dc.typetext

Files

Collections

arXiv