Score lists of oriented tripartite graphs.
On imbalances in digraphs
Signed degree sets in signed graphs
The set of distinct signed degrees of the vertices in a signed graph 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.
Tripartite multidigraphs and imbalances
Optimal allocation in multivariate sampling through Chebyshev approximation.
Page 1