Kings and serfs in oriented graphs

DOI10.2478/S12175-008-0073-4MaRDI QIDQ5386996zbMATH OpenOpenAlexFDO

Authors Nasir A. Shah, Shariefuddin Pirzada

Publication date 14 May 2008

Published in Mathematica Slovaca (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

Full work available at URL https://arxiv.org/abs/math/0609203

zbMATH Keywords

kingoriented graphscoreserftournament

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Abstract: 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). 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.

Recommendations

• On king-serf pair in tournaments
• Kings in locally semicomplete digraphs
• Kings in quasi-transitive digraphs
• Digraphs with unique minimal king sets
• Kings in semicomplete multipartite digraphs

Cites work

• The radii of n-partite tournaments

Cited in

(4)

• On king-serf pair in tournaments
• Kings, name days, lazy servants and magic
• Weak king embeddings of oriented graphs
• Toppling kings in multipartite tournaments by introducing new kings

This page was built for publication: Kings and serfs in oriented graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5386996)