1. Signed degree sets in signed graphs
- Creator:
- Pirzada, Shariefuddin, Naikoo, T. A., and Dar, F. A.
- Format:
- bez média and svazek
- Type:
- model:article and TEXT
- Subject:
- signed graphs
- Language:
- English
- Description:
- 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.
- Rights:
- http://creativecommons.org/publicdomain/mark/1.0/ and policy:public