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 条
  • [41] Super-cyclically edge-connected regular graphs
    Jin-Xin Zhou
    Yan-Quan Feng
    Journal of Combinatorial Optimization, 2013, 26 : 393 - 411
  • [42] Maximally edge-connected realizations and Kundu's k $k$-factor theorem
    Shook, James M. M.
    JOURNAL OF GRAPH THEORY, 2024, 105 (01) : 83 - 97
  • [43] Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth
    Liu, Saihua
    Ouyang, Chen
    Ou, Jianping
    LINEAR & MULTILINEAR ALGEBRA, 2022, 70 (06): : 1146 - 1158
  • [44] UNAVOIDABLE IMMERSIONS OF 4− AND f(t)−EDGE-CONNECTED GRAPHS
    Ding, Guoli
    Qualls, Brittian
    arXiv,
  • [45] SUFFICIENT CONDITIONS FOR MAXIMALLY CONNECTED DENSE GRAPHS
    SONEOKA, T
    NAKADA, H
    IMASE, M
    PEYRAT, C
    DISCRETE MATHEMATICS, 1987, 63 (01) : 53 - 66
  • [46] Sufficient conditions for triangle-free graphs to be super k-restricted edge-connected
    Yuan, Jun
    Liu, Aixia
    INFORMATION PROCESSING LETTERS, 2016, 116 (02) : 163 - 167
  • [47] Sufficient conditions for graphs with girth g to be maximally k-restricted edge connected
    Zhang, Lei
    Wang, Shiying
    DISCRETE APPLIED MATHEMATICS, 2019, 255 : 320 - 325
  • [48] Maximally local-edge-connected graphs and digraphs
    Hellwig, A
    Volkmann, L
    ARS COMBINATORIA, 2004, 72 : 295 - 306
  • [49] Sufficient conditions for a graph to be super restricted edge-connected
    Wang, Shiying
    Lin, Shangwei
    NETWORKS, 2008, 51 (03) : 200 - 209
  • [50] Decomposing highly edge-connected graphs into paths of any given length
    Botler, F.
    Mota, G. O.
    Oshiro, M. T. I.
    Wakabayashi, Y.
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2017, 122 : 508 - 542
12345