J4 ›› 2014, Vol. 27 ›› Issue (1): 98-101.doi: 10.3976/j.issn.1002-4026.2014.01.017
• Article • Previous Articles Next Articles
WANG Xiao-Li1, WANG Shi-Ying2
Received:
Online:
Published:
Abstract:
Let D be a digraph and δ(D) be its minimum degree. Then λ(D)≤δ(D) exists. A digraph D is nonmaximally arcconnected if λ(D)<δ(D). This paper presents the lower bounds of the arcconnectivity of a nonmaximally arcconnected digraph.
Key words: digraph, arc-connectivity, degree sequence, clique number
CLC Number:
O157.5
WANG Xiao-Li, WANG Shi-Ying. Lower bounds of the arcconnectivity of a nonmaximally arc-connected digraph[J].J4, 2014, 27(1): 98-101.
0 / / Recommend
Add to citation manager EndNote|Reference Manager|ProCite|BibTeX|RefWorks
URL: https://www.sdkx.net/EN/10.3976/j.issn.1002-4026.2014.01.017
https://www.sdkx.net/EN/Y2014/V27/I1/98
Cited
