J4 ›› 2014, Vol. 27 ›› Issue (1): 98-101.doi: 10.3976/j.issn.1002-4026.2014.01.017

• Article • Previous Articles     Next Articles

Lower bounds of the arcconnectivity of a nonmaximally arc-connected digraph

 WANG Xiao-Li1, WANG Shi-Ying2   

  1. 1. School of Mathematics, Jinzhong University, Jinzhong 030600, China;
      2. School of Mathematics, Shanxi University, Taiyuan 030006, China
  • Received:2013-04-01 Published:2014-02-20 Online:2014-02-20

Abstract:

Let D be a digraph and δ(D) be its minimum degree. Then λ(D)≤δ(D) exists. A digraph D is nonmaximally arcconnected if λ(D)<δ(D). This paper presents the lower bounds of the arcconnectivity of a nonmaximally arcconnected digraph.

Key words: digraph, arc-connectivity, degree sequence, clique number

CLC Number: 

  • O157.5

Open Access This article is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0), which permits third parties to freely share (i.e., copy and redistribute the material in any medium or format) and adapt (i.e., remix, transform, or build upon the material) the articles published in this journal, provided that appropriate credit is given, a link to the license is provided, and any changes made are indicated. The material may not be used for commercial purposes. For details of the CC BY-NC 4.0 license, please visit: https://creativecommons.org/licenses/by-nc/4.0