Sufficient conditions for maximally restricted edge connected graphs

被引：1
|
作者：
Qin, Yingying [1 ]
Ou, Jianping [1 ]
机构：
[1] Wuyi Univ, Dept Math, Jiangmen 529020, Peoples R China
来源：
DISCRETE MATHEMATICS | 2012年 / 312卷 / 19期
基金：
中国国家自然科学基金;
关键词：
Restricted edge connectivity; Degree sequence;
D O I：
10.1016/j.disc.2012.05.008
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
It is shown in this work that if graph G has degree sequence d(1) >= d(2) >= ... >= d(n) >= 2 with Sigma(l)(i=1)(d(i) + d(n-i-1)) > l(n + 2) holding for every 1 <= l <= n/2 - 2, then it is lambda'-optimal. The lower bound on the degree-summation is exemplified sharp. This observation generalizes the corresponding results of Bollobas on maximal edge connectivity of graphs. (C) 2012 Elsevier B.V. All rights reserved.
引用
收藏
页码：2969 / 2972
页数：4
相关论文
共 50 条
  • [1] 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
  • [2] 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
  • [3] 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
  • [4] Sufficient conditions for k-restricted edge connected graphs
    Wang, Shiying
    Zhang, Lei
    THEORETICAL COMPUTER SCIENCE, 2014, 557 : 66 - 75
  • [5] 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
  • [6] SUFFICIENT CONDITIONS FOR MAXIMALLY CONNECTED DENSE GRAPHS
    SONEOKA, T
    NAKADA, H
    IMASE, M
    PEYRAT, C
    DISCRETE MATHEMATICS, 1987, 63 (01) : 53 - 66
  • [7] Degree conditions for graphs to be maximally k-restricted edge connected and super k-restricted edge connected
    Wang, Shiying
    Zhao, Nana
    DISCRETE APPLIED MATHEMATICS, 2015, 184 : 258 - 263
  • [8] 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
  • [9] 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
  • [10] 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