Characterization of Digraphic Sequences with Strongly Connected Realizations
Yanmei Hong, Qinghai Liu, Hong‐Jian Lai · Journal of Graph Theory · 2016
Abstract Let be a sequence of of nonnegative integers pairs. If a digraphDwith satisfies and for eachiwith , thendis called a degree sequence ofD. IfDis a strict digraph, thendis called a strict digraphic sequence. Let be the collection of digraphs with degree sequenced. We characterize strict digraphic sequencesdfor which there exists a strict strong digraph .