Sufficient conditions for optimally and super m-restricted edge-connected graphs with given girth

被引：0
|
作者：
Liu, Saihua [1 ]
Ouyang, Chen [2 ]
Ou, Jianping [1 ]
机构：
[1] Wuyi Univ, Dept Math, Jiangmen, Peoples R China
[2] Dongguan Univ Technol, Sch Comp Sci & Technol, Dongguan 523000, Peoples R China
来源：
LINEAR & MULTILINEAR ALGEBRA | 2022年 / 70卷 / 06期
基金：
中国国家自然科学基金;
关键词：
Girth; m-restricted edge connectivity; lambda(m)-optimal; super-lambda(m); CUTS LEAVING COMPONENTS; ORDER;
D O I：
10.1080/03081087.2020.1754749
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
A -connected graph G is optimally m-restricted edge-connected if its m-restricted edge-connectivity equals the minimum m-edge-degree , and super m-restricted edge-connected if all minimum m-restricted edge cuts are trivial. In this study, a bound for the size of graphs with girth greater than any given integer l is obtained firstly. Then the second minimum degree conditions for optimally and super m-restricted edge-connected graphs with girth greater than l are provided. Furthermore, the relationship between optimally m-restricted edge connectivity and optimally -restricted edge connectivity is characterized.
引用
收藏
页码：1146 / 1158
页数：13
相关论文
共 50 条
  • [21] Sufficient Conditions for Maximally Edge-connected and Super-edge-connected Digraphs Depending on the Size
    Sebastian MILZ
    Lutz VOLKMANN
    ActaMathematicaSinica, 2019, 35 (12) : 1861 - 1870
  • [22] Super cyclically edge-connected vertex-transitive graphs of girth at least 5
    Zhou, Jin Xin
    Li, Yan Tao
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2013, 29 (08) : 1569 - 1580
  • [23] Super cyclically edge-connected vertex-transitive graphs of girth at least 5
    Jin Xin Zhou
    Yan Tao Li
    Acta Mathematica Sinica, English Series, 2013, 29 : 1569 - 1580
  • [24] 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
  • [25] On Optimizing m-Restricted Edge Connectivity of Graphs
    Ou, Jianping
    Wu, Jichang
    HIGH PERFORMANCE NETWORKING, COMPUTING, AND COMMUNICATION SYSTEMS, 2011, 163 : 32 - +
  • [26] Degree Sequence Conditions for Maximally Edge-Connected and Super Edge-Connected Hypergraphs
    Zhao, Shuang
    Tian, Yingzhi
    Meng, Jixiang
    GRAPHS AND COMBINATORICS, 2020, 36 (04) : 1065 - 1078
  • [27] Degree Sequence Conditions for Maximally Edge-Connected and Super Edge-Connected Hypergraphs
    Shuang Zhao
    Yingzhi Tian
    Jixiang Meng
    Graphs and Combinatorics, 2020, 36 : 1065 - 1078
  • [28] Neighborhood Conditions for Graphs to be Super Restricted Edge Connected
    Wang, Shiying
    Li, Jing
    Wu, Lihong
    Lin, Shangwei
    NETWORKS, 2010, 56 (01) : 11 - 19
  • [29] On super 2-restricted and 3-restricted edge-connected vertex transitive graphs
    Yang, Weihua
    Zhang, Zhao
    Qin, Chengfu
    Guo, Xiaofeng
    DISCRETE MATHEMATICS, 2011, 311 (23-24) : 2683 - 2689
  • [30] Sufficient Conditions for Maximally Edge-Connected Hypergraphs
    Lin-Ken Tong
    Er-Fang Shan
    Journal of the Operations Research Society of China, 2021, 9 : 119 - 129
12345