Degree sequence conditions for equal edge‐connectivity and minimum degree,depending on the clique number |
| |
Authors: | Lutz Volkmann |
| |
Abstract: | 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 |
| |
Keywords: | edge‐connectivity degree sequence clique number |
|
|