Degree sequence for k-arc strongly connected multiple digraphs

作者：Hong, Yanmei; Liu, Qinghai^*

来源：JOURNAL OF INEQUALITIES AND APPLICATIONS, 2017, 2017(1): 266.

DOI：10.1186/s13660-017-1544-3

• degree sequence
• realization
• k-arc strongly connected

Let D be a digraph on {v(1), ... , v(n)}. Then the sequence {(d(+)(v(1)), d(-)(v(1))), ... , (d(+)(v(n)), d(-)(v(n)))} is called the degree sequence of D. For any given sequence of pairs of integers d = {( d(1)(+), d(1)(-)), ... , (d(n)(+), d(n)(-))}, if there exists a k-arc strongly connected digraph D such that d is the degree sequence of D, then d is realizable and D is a realization of d. In this paper, characterizations for k-arc-connected realizable sequences and realizable sequences with arc-connectivity exactly k are given.

• 出版日期2017-10-25
• 单位福州大学