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 条
  • [41] Extremal Values of the Chromatic Number for a Given Degree Sequence
    Stéphane Bessy
    Dieter Rautenbach
    Graphs and Combinatorics, 2017, 33 : 789 - 799
  • [42] Existence of 4-factors in star-free graphs with edge-connectivity conditions
    Egawa, Yoshimi
    Kotani, Keiko
    Yamamoto, Jumpei
    AKCE INTERNATIONAL JOURNAL OF GRAPHS AND COMBINATORICS, 2024, 21 (01) : 41 - 47
  • [43] On the clique number of the square of a line graph and its relation to maximum degree of the line graph
    Faron, Maxime
    Postle, Luke
    JOURNAL OF GRAPH THEORY, 2019, 92 (03) : 261 - 274
  • [44] Vertex-degree function index for concave functions of graphs with a given clique number
    Yang, Jiaxiang
    Liu, Hechao
    Wang, Yixiang
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2024, 70 (03) : 2197 - 2208
  • [45] Degree sequence conditions for a graph to be disjoint path coverable
    Sabir, Eminjan
    Meng, Jixiang
    DISCRETE APPLIED MATHEMATICS, 2023, 332 : 62 - 69
  • [46] Largest domination number and smallest independence number of forests with given degree sequence
    Gentner, Michael
    Henning, Michael A.
    Rautenbach, Dieter
    DISCRETE APPLIED MATHEMATICS, 2016, 206 : 181 - 187
  • [47] Fractional coloring with local demands and applications to degree-sequence bounds on the independence number
    Kelly, Tom
    Postle, Luke
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2024, 169 : 298 - 337
  • [48] Best monotone degree conditions for binding number and cycle structure
    Bauer, D.
    Nevo, A.
    Schmeichel, E.
    Woodall, D. R.
    Yatauro, M.
    DISCRETE APPLIED MATHEMATICS, 2015, 195 : 8 - 17
  • [49] Smallest domination number and largest independence number of graphs and forests with given degree sequence
    Gentner, Michael
    Henning, Michael A.
    Rautenbach, Dieter
    JOURNAL OF GRAPH THEORY, 2018, 88 (01) : 131 - 145
  • [50] Extremal trees with fixed degree sequence for atom-bond connectivity index
    Xing, Rundan
    Zhou, Bo
    FILOMAT, 2012, 26 (04) : 683 - 688
12345