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] Sufficient conditions for hypergraphs to be maximally edge-connecte
    Zhao, Shuang
    Meng, Jixiang
    APPLIED MATHEMATICS AND COMPUTATION, 2018, 333 : 362 - 368
  • [42] Enumeration of the degree sequences of 3-connected graphs and cactus graphs
    Liang, Yueming
    Liu, Bolian
    ARS COMBINATORIA, 2016, 126 : 249 - 258
  • [43] Sufficient conditions for graphs to be spanning connected
    Sabir, Eminjan
    Meng, Jixiang
    APPLIED MATHEMATICS AND COMPUTATION, 2020, 378
  • [44] Majorization, degree sequence and Aα-spectral characterization of graphs
    Lin, Huiqiu
    Zhang, Liwen
    Xue, Jie
    DISCRETE MATHEMATICS, 2020, 343 (12)
  • [45] The Spectral Radii of Graphs with Prescribed Degree Sequence
    Li, Jianxi
    Shiu, Wai Chee
    KYUNGPOOK MATHEMATICAL JOURNAL, 2014, 54 (03): : 425 - 441
  • [46] Monochromatic connecting colorings in strongly connected oriented graphs
    Gonzalez-Moreno, Diego
    Guevara, Mucuy-Kak
    Jose Montellano-Ballesteros, Juan
    DISCRETE MATHEMATICS, 2017, 340 (04) : 578 - 584
  • [47] Edge-connectivity and edge-superconnectivity in sequence graphs
    Balbuena, C.
    Fabrega, J.
    Garcia-Vazquez, P.
    DISCRETE APPLIED MATHEMATICS, 2007, 155 (16) : 2053 - 2060
  • [48] Degree sequence of oriented k-hypergraphs
    Zhou, Guofei
    Pirzada, S.
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2008, 27 (1-2) : 149 - 158
  • [49] Oriented cliques and colorings of graphs with low maximum degree
    Dybizbanski, Janusz
    Ochem, Pascal
    Pinlou, Alexandre
    Szepietowski, Andrzej
    DISCRETE MATHEMATICS, 2020, 343 (05)
  • [50] Sufficient Degree Conditions for k-Edge-Connectedness of a Graph
    Bauer, D.
    Hakimi, S. L.
    Kahl, N.
    Schmeichel, E.
    NETWORKS, 2009, 54 (02) : 95 - 98
12345