Sufficient Conditions for Super-Arc-Strongly Connected Oriented Graphs

被引：1
|
作者：
Wang, Shiying [1 ]
Yuan, Jun [1 ]
Liu, Aixia [2 ]
机构：
[1] Shanxi Univ, Sch Math Sci, Taiyuan 030006, Peoples R China
[2] Shanxi Univ, Coll Business, Taiyuan 030031, Peoples R China
来源：
GRAPHS AND COMBINATORICS | 2008年 / 24卷 / 06期
基金：
中国国家自然科学基金;
关键词：
Digraphs; oriented graphs; arc-strong connectivity;
D O I：
10.1007/s00373-008-0810-z
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A digraph D is called super-arc-strongly connected if the arcs of every its minimum arc-disconnected set are incident to or from some vertex in D. A digraph without any directed cycle of length 2 is called an oriented graph. Sufficient conditions for digraphs to be super-arc-strongly connected have been given by several authors. However, closely related conditions for super-arc-strongly connected oriented graphs have little attention until now. In this paper we present some minimum degree and degree sequence conditions for oriented graphs to be super-arc-strongly connected.
引用
收藏
页码：587 / 595
页数：9
相关论文
共 50 条
  • [1] Sufficient Conditions for Super-Arc-Strongly Connected Oriented Graphs
    Shiying Wang
    Jun Yuan
    Aixia Liu
    Graphs and Combinatorics, 2008, 24 : 587 - 595
  • [2] Sufficient Conditions for Graphs to Be k-Connected, Maximally Connected, and Super-Connected
    Hong, Zhen-Mu
    Xia, Zheng-Jiang
    Chen, Fuyuan
    Volkmann, Lutz
    COMPLEXITY, 2021, 2021
  • [3] Sufficient conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number
    Volkmann, Lutz
    ARS COMBINATORIA, 2010, 96 : 105 - 114
  • [4] Sufficient conditions for maximally edge-connected graphs and arc-connected digraphs
    Wang, Shiying
    Zhang, Guozhen
    Wang, Xiuli
    AUSTRALASIAN JOURNAL OF COMBINATORICS, 2011, 50 : 233 - 242
  • [5] Sufficient conditions for graphs to be λ′-optimal super-edge-connected and maximally edge-connected
    Hellwig, A
    Volkmann, L
    JOURNAL OF GRAPH THEORY, 2005, 48 (03) : 228 - 246
  • [6] Sufficient conditions for bipartite graphs to be super-k-restricted edge connected
    Yuan, Jun
    Liu, Aixia
    Wang, Shiying
    DISCRETE MATHEMATICS, 2009, 309 (09) : 2886 - 2896
  • [7] Degree sequence conditions for super-edge-connected oriented graphs
    Volkmann, Lutz
    Journal of Combinatorial Mathematics and Combinatorial Computing, 2009, 68 : 193 - 204
  • [8] Sufficient conditions for graphs to be spanning connected
    Sabir, Eminjan
    Meng, Jixiang
    APPLIED MATHEMATICS AND COMPUTATION, 2020, 378
  • [9] SUFFICIENT CONDITIONS FOR MAXIMALLY CONNECTED DENSE GRAPHS
    SONEOKA, T
    NAKADA, H
    IMASE, M
    PEYRAT, C
    DISCRETE MATHEMATICS, 1987, 63 (01) : 53 - 66
  • [10] SUFFICIENT CONDITIONS FOR MAXIMALLY EDGE-CONNECTED AND SUPER-EDGE-CONNECTED GRAPHS DEPENDING ON THE CLIQUE NUMBER
    Volkmann, Lutz
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2019, 39 (02) : 567 - 573
12345