Score sets in oriented bipartite graphs

Details Score sets in oriented bipartite graphs Score sets in oriented bipartite graphs

2006-09-05

arxiv.org/abs/math/0609135v1

Novi Sad J. Mathematics, Vol.36, No.1(2006)35-45

Mathematics

Combinatorics

Scientific paper

The set A of distinct scores of the vertices of an oriented bipartite graph D(U, V) is called its score set. We consider the following question: given a finite, nonempty set A of positive integers, is there an oriented bipartite graph D(U, V) such that score set of D(U, V) is A? We conjecture that there is an affirmative answer, and verify this conjecture when $\mid A\mid $ = 1, 2, 3, or when A is a geometric or arithmetic progression.

Affiliated with

Also associated with

No associations

Rating

Score sets in oriented bipartite 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 Score sets in oriented bipartite graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Score sets in oriented bipartite graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-554978