A NOTE ON SIGNED DEGREE SETS IN SIGNED BIPARTITE GRAPHS

A signed bipartite graph $G(U, V)$ is a bipartite graph in which each edge is assigneda positive or a negative sign. The signed degree of a vertex $x$ in $G(U, V)$ isthe number of positive edges incident with $x$ less the number of negativeedges incident with $x$. The set $S$ of distinct signed degrees of the verticesof $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.