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 条
  • [31] Sufficient Conditions for Maximally Edge-Connected Hypergraphs
    Tong, Lin-Ken
    Shan, Er-Fang
    JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2021, 9 (01) : 119 - 129
  • [32] Sufficient conditions for k-restricted edge connected graphs
    Wang, Shiying
    Zhang, Lei
    THEORETICAL COMPUTER SCIENCE, 2014, 557 : 66 - 75
  • [33] A SUFFICIENT CONDITION FOR GRAPHS TO BE SUPER k-RESTRICTED EDGE CONNECTED
    Wang, Shiying
    Wang, Meiyu
    Zhang, Lei
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2017, 37 (03) : 537 - 545
  • [34] Super-cyclically edge-connected regular graphs
    Zhou, Jin-Xin
    Feng, Yan-Quan
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 26 (02) : 393 - 411
  • [35] 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
  • [36] On m-restricted edge connectivity of Cartesian Product graphs
    Qin, Yingying
    Ou, Jianping
    Zhao, Weisheng
    INTERNATIONAL JOURNAL OF APPLIED MATHEMATICS & STATISTICS, 2016, 54 (02): : 105 - 113
  • [37] Super-cyclically edge-connected regular graphs
    Jin-Xin Zhou
    Yan-Quan Feng
    Journal of Combinatorial Optimization, 2013, 26 : 393 - 411
  • [38] 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
  • [39] Optimally restricted edge connected elementary Harary graphs
    Liu, Qinghai
    Huang, Xiaohui
    Zhang, Zhao
    THEORETICAL COMPUTER SCIENCE, 2013, 497 : 131 - 138
  • [40] On optimizing m-restricted edge connectivity of generalized permutation graphs
    Zhu, Tiedan
    Ou, Jianping
    ARS COMBINATORIA, 2014, 113A : 77 - 84
12345