Degree sequence conditions for maximally edge-connected oriented graphs

被引：3
|
作者：
Volkmann, Lutz [1 ]
机构：
[1] Univ Aachen, Rhein Westfal TH Aachen, Lehrstuhl Math 2, D-52056 Aachen, Germany
来源：
APPLIED MATHEMATICS LETTERS | 2006年 / 19卷 / 11期
关键词：
-oriented graph; edge-connectivity; degree sequence; oriented bipartite graph;
D O I：
10.1016/j.aml.2006.01.011
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
If D is a digraph, delta(D) its minimum degree and; lambda(D) its edge-connectivity, then; lambda(D) <= delta(D). A digraph D is called maximally edge-connected if; lambda(D) = delta(D). A digraph without any directed cycle of length 2 is called an oriented graph. Sufficient conditions for digraphs to be maximally edge-connected have been given by several authors. However, closely related conditions for maximally edge-connected oriented graphs have received little attention until recently. In this work we will present some degree sequence conditions for oriented graphs as well as for oriented bipartite graphs to be maximally edge-connected. (c) 2006 Elsevier Ltd. All rights reserved.
引用
收藏
页码：1255 / 1260
页数：6
相关论文
共 50 条
  • [31] Vulnerability of super extra edge-connected graphs
    Cheng, Chia-Wen
    Hsieh, Sun-Yuan
    Klasing, Ralf
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2020, 108 : 1 - 9
  • [32] Minimally (k, k)-edge-connected graphs
    Hennayake, K
    Lai, HJ
    Li, DY
    Ma, JZ
    JOURNAL OF GRAPH THEORY, 2003, 44 (02) : 116 - 131
  • [33] Degree sequences of optimally edge-connected multigraphs
    Dankelmann, P
    Oellermann, O
    ARS COMBINATORIA, 2005, 77 : 161 - 168
  • [34] Sufficient conditions for triangle-free graphs to be optimally restricted edge-connected
    Meierling, Dirk
    Volkmann, Lutz
    DISCRETE APPLIED MATHEMATICS, 2012, 160 (12) : 1775 - 1781
  • [35] Highly edge-connected detachments of graphs and digraphs
    Berg, AR
    Jackson, B
    Jordán, T
    JOURNAL OF GRAPH THEORY, 2003, 43 (01) : 67 - 77
  • [36] Sufficient conditions for graphs to be maximally 4-restricted edge connected
    Wang, Mujiangshan
    Lin, Yuqing
    Wang, Shiying
    Wang, Meiyu
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2018, 70 : 123 - 136
  • [37] Super-cyclically edge-connected regular graphs
    Zhou, Jin-Xin
    Feng, Yan-Quan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 26 (02) : 393 - 411
  • [38] On the existence of super edge-connected graphs with prescribed degrees
    Tian, Yingzhi
    Meng, Jixiang
    Lai, Hongjian
    Zhang, Zhao
    DISCRETE MATHEMATICS, 2014, 328 : 36 - 41
  • [39] Maximally edge-connected graphs and Zeroth-order general Randic index for 0 &lt; α &lt; 1
    Su, Guifu
    Xiong, Liming
    Su, Xiaofeng
    DISCRETE APPLIED MATHEMATICS, 2014, 167 : 261 - 268
  • [40] CRITICAL N-FOLD EDGE-CONNECTED GRAPHS
    MADER, W
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1986, 40 (02) : 152 - 158
12345