Degree sequence conditions for equal edge-connectivity and minimum degree, depending on the clique number

被引：5
|
作者：
Volkmann, L [1 ]
机构：
[1] Rhein Westfal TH Aachen, Lehrstuhl Math 2, D-52056 Aachen, Germany
来源：
JOURNAL OF GRAPH THEORY | 2003年 / 42卷 / 03期
关键词：
edge-connectivity; degree sequence; clique number;
D O I：
10.1002/jgt.10087
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
Using the well-known Theorem of Turan, we present in this paper degree sequence conditions for the equality of edge-connectivity and minimum degree, depending on the clique number of a graph. Different examples will show that these conditions are best possible and independent of all the known results in this area. (C) 2003 Wiley Periodicals, Inc.
引用
收藏
页码：234 / 245
页数：12
相关论文
共 50 条
  • [1] Minimum degree, edge-connectivity and radius
    Wu, Baoyindureng
    An, Xinhui
    Liu, Guojie
    Yan, Guiying
    Liu, Xiaoping
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2013, 26 (03) : 585 - 591
  • [2] Minimum degree, edge-connectivity and radius
    Baoyindureng Wu
    Xinhui An
    Guojie Liu
    Guiying Yan
    Xiaoping Liu
    Journal of Combinatorial Optimization, 2013, 26 : 585 - 591
  • [3] Degree sequence conditions for maximally edge-connected graphs depending on the clique number
    Dankelmann, P
    Volkmann, L
    DISCRETE MATHEMATICS, 2000, 211 (1-3) : 217 - 223
  • [4] Degree sequence conditions for maximally edge-connected and super-edge-connected oriented graphs depending on the clique number
    Volkmann, Lutz
    ARS COMBINATORIA, 2011, 99 : 55 - 64
  • [5] Restricted edge-connectivity and minimum edge-degree
    Ueffing, N
    Volkmann, L
    ARS COMBINATORIA, 2003, 66 : 193 - 203
  • [6] Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number
    Milz, Sebastian
    Volkmann, Lutz
    DISCRETE MATHEMATICS, 2018, 341 (02) : 484 - 491
  • [7] On the minimum degree, edge-connectivity and connectivity of power graphs of finite groups
    Panda, Ramesh Prasad
    Krishna, K. V.
    COMMUNICATIONS IN ALGEBRA, 2018, 46 (07) : 3182 - 3197
  • [8] Inverse degree and edge-connectivity
    Dankelmann, Peter
    Hellwig, Angelika
    Volkmann, Lutz
    DISCRETE MATHEMATICS, 2009, 309 (09) : 2943 - 2947
  • [9] Inverse degree and super edge-connectivity
    Tian, Yingzhi
    Guo, Litao
    Meng, Jixiang
    Qin, Chengfu
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2012, 89 (06) : 752 - 759
  • [10] Characterizing Forbidden Pairs for the Edge-Connectivity of a Connected Graph to Be Its Minimum Degree
    Du, Junfeng
    Huang, Ziwen
    Xiong, Liming
    AXIOMS, 2022, 11 (05)
12345