Signed degree sets in signed bipartite graphs

Details Signed degree sets in signed bipartite graphs Signed degree sets in signed bipartite graphs

2006-09-05

arxiv.org/abs/math/0609122v2

Mathematics

Combinatorics

Scientific paper

A signed bipartite graph G(U, V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident with x less the number of negative edges incident with x. The set S of distinct signed degrees of the vertices of G(U, V) is called its signed degree set. In this paper, we prove that every set of integers is the signed degree set of some connected signed bipartite graph. \medskip \medskip

Affiliated with

Also associated with

No associations

Rating

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

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-554951