Premium
Degree sequence conditions for equal edge‐connectivity and minimum degree, depending on the clique number
Author(s) -
Volkmann Lutz
Publication year - 2003
Publication title -
journal of graph theory
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 1.164
H-Index - 54
eISSN - 1097-0118
pISSN - 0364-9024
DOI - 10.1002/jgt.10087
Subject(s) - mathematics , combinatorics , degree (music) , clique , sequence (biology) , discrete mathematics , graph , clique number , clique graph , enhanced data rates for gsm evolution , graph theory , line graph , graph power , computer science , telecommunications , physics , biology , acoustics , genetics
Using the well‐known Theorem of Turán, 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. © 2003 Wiley Periodicals, Inc. J Graph Theory 42: 234–245, 2003