| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 8900893 | Applied Mathematics and Computation | 2018 | 7 Pages |
Abstract
Let H be a connected hypergraph. H is said to be linear if any two edges of H share at most one vertex. If all edges of H have the same cardinality, then H is uniform. We call H maximally edge-connected if the edge-connectivity of H attains its minimum degree. In this paper, we present some sufficient conditions for linear uniform hypergraphs to be maximally edge-connected that generalize the corresponding well-known results for graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Shuang Zhao, Jixiang Meng,