Kings and serfs in oriented graphs

Details Kings and serfs in oriented graphs Kings and serfs in oriented graphs

2006-09-07

arxiv.org/abs/math/0609203v1

Mathematics

Combinatorics

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Kings and serfs in oriented graphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Kings and serfs in oriented graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Kings and serfs in oriented graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-318087