| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4646793 | Discrete Mathematics | 2016 | 6 Pages |
Abstract
The edge-connectivity of a connected graph or hypergraph is the minimum number of edges whose removal renders the graph or hypergraph, respectively, disconnected. The edge-connectivity of a (hyper) graph cannot exceed its minimum degree. For graphs, several sufficient conditions for equality of edge-connectivity and minimum degree are known. For example Chartrand (1966) showed that for every graph of order nn and minimum degree at least n−12 its edge-connectivity equals its minimum degree. We show that this and some other well-known sufficient conditions generalise to hypergraphs.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Peter Dankelmann, Dirk Meierling,