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 条
  • [31] The Number of Subtrees of Trees with Given Degree Sequence
    Zhang, Xiu-Mei
    Zhang, Xiao-Dong
    Gray, Daniel
    Wang, Hua
    JOURNAL OF GRAPH THEORY, 2013, 73 (03) : 280 - 295
  • [32] The Minimal Number of Subtrees with a Given Degree Sequence
    Zhang, Xiu-Mei
    Zhang, Xiao-Dong
    GRAPHS AND COMBINATORICS, 2015, 31 (01) : 309 - 318
  • [33] The Minimal Number of Subtrees with a Given Degree Sequence
    Xiu-Mei Zhang
    Xiao-Dong Zhang
    Graphs and Combinatorics, 2015, 31 : 309 - 318
  • [34] Minimum degree conditions for the strength and bandwidth of graphs
    Ichishima, Rikio
    Muntaner-Batle, Francesc A.
    Oshima, Akito
    DISCRETE APPLIED MATHEMATICS, 2022, 320 : 191 - 198
  • [35] Sufficient Degree Conditions for k-Edge-Connectedness of a Graph
    Bauer, D.
    Hakimi, S. L.
    Kahl, N.
    Schmeichel, E.
    NETWORKS, 2009, 54 (02) : 95 - 98
  • [36] Best monotone degree conditions for binding number
    Bauer, D.
    Yatauro, M.
    Kahl, N.
    Schmeichel, E.
    DISCRETE MATHEMATICS, 2011, 311 (18-19) : 2037 - 2043
  • [37] Spectral conditions for graphs to be β-deficient involving minimum degree
    Liu, Weijun
    Liu, Minmin
    Feng, Lihua
    LINEAR & MULTILINEAR ALGEBRA, 2018, 66 (04) : 792 - 802
  • [38] A characterization of the degree sequence of the graph with cyclomatic number k
    Meng, Lei
    Yin, Jian-Hua
    ARS COMBINATORIA, 2017, 130 : 67 - 70
  • [39] Extremal Values of the Chromatic Number for a Given Degree Sequence
    Bessy, Stephane
    Rautenbach, Dieter
    GRAPHS AND COMBINATORICS, 2017, 33 (04) : 789 - 799
  • [40] The minimum restricted edge-connected graph and the minimum size of graphs with a given edge-degree
    Yang, Weihua
    Tian, Yingzhi
    Li, Hengzhe
    Li, Hao
    Guo, Xiaofeng
    DISCRETE APPLIED MATHEMATICS, 2014, 167 : 304 - 309
12345