• Journal of applied mathematics & informatics
• /
• v.27 no.5_6
• /
• pp.1405-1410
• /
• 2009

A tripartite $\gamma$-digraph is an orientation of a tripartite multigraph that is without loops and contains at most $\gamma$ edges between any pair of vertices from distinct parts. In this paper, we obtain necessary and sufficient conditions for sequences of non-negative integers in non-decreasing order to be the sequences of numbers, called marks (or $\gamma$-scores), attached to the vertices of a tripartite $\gamma$-digraph.