Paper Info
Title
Sufficient conditions for hypergraphs to be maximally edge-connected.
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.
Year
DOI
Venue
2018
10.1016/j.amc.2018.03.109
Applied Mathematics and Computation
Keywords
Field
DocType
Edge-connectivity,Hypergraph,Maximally edge-connected
Graph,Combinatorics,Vertex (geometry),Mathematical analysis,Hypergraph,Constraint graph,Cardinality,Mathematics
Journal
Volume
ISSN
Citations 
333
0096-3003
0
PageRank 
References 
Authors
0.34
5
2
Name
Order
Citations
PageRank
Shuang Zhao13012.77
Jixiang Meng235355.62