Characterization of Digraphic Sequences with Strongly Connected Realizations |
| |
| Authors: | Yanmei Hong Qinghai Liu Hong‐Jian Lai |
| |
| Institution: | 1. DEPARTMENT OF MATHEMATICS, FUZHOU UNIVERSITY, FUZHOU, CHINA;2. CENTER FOR DISCRETE MATHEMATICS, FUZHOU UNIVERSITY, FUZHOU, FUJIAN, CHINA;3. DEPARTMENT OF MATHEMATICS, WEST VIRGINIA UNIVERSITY, MORGANTOWN, WEST VIRGINIA |
| |
| Abstract: | Let  be a sequence of of nonnegative integers pairs. If a digraph D with  satisfies  and  for each i with  , then d is called a degree sequence of D. If D is a strict digraph, then d is called a strict digraphic sequence. Let  be the collection of digraphs with degree sequence d . We characterize strict digraphic sequences d for which there exists a strict strong digraph  . |
| |
| Keywords: | strongly connected degree sequence degree sequence realizations |
|
|
be a sequence of of nonnegative integers pairs. If a digraph D with 
satisfies 
and 
for each i with 
, then d is called a degree sequence of D. If D is a strict digraph, then d is called a strict digraphic sequence. Let 
be the collection of digraphs with degree sequence d . We characterize strict digraphic sequences d for which there exists a strict strong digraph 
.