Journal of Research of the National Institute of Standards and Technology
A digraph whose degree sequence has a unique vertex labeled realization is called threshold. In this paper we present several characterizations of threshold digraphs and their degree sequences, and show these characterizations to be equivalent. Using this result, we obtain a new, short proof of the Fulkerson-Chen theorem on degree sequences of general digraphs.
Cloteaux, B., LaMar, M. D., Moseman, E., & Shook, J. (2014). Threshold digraphs. Journal of research of the National Institute of Standards and Technology, 119, 227.