The set $D$ of distinct signed degrees of the vertices in a signed graph $G$ is called its signed degree set. In this paper, we prove that every non-empty set of positive (negative) integers is the signed degree set of some connected signed graph and determine the smallest possible order for such a signed graph. We also prove that every non-empty set of integers is the signed degree set of some connected signed graph.
 G. Chartrand, H. Gavlas, F. Harary and M. Schultz: On signed degrees in signed graphs
. Czech. Math. J. 44 (1994), 677–690. MR 1295143
 S. L. Hakimi: On the realizability of a set of integers as degrees of the vertices of a graph
. SIAM J. Appl. Math. 10 (1962), 496–506. DOI 10.1137/0110037
| MR 0148049
 S. F. Kapoor, A. O. Polimeni and C. E. Wall: Degree sets for graphs
. Fund. Math. 65 (1977), 189–194. MR 0480200