Edge-connectivity in hypergraphs

Shuang Zhao (), Dan Li and Jixiang Meng ()
Additional contact information
Shuang Zhao: Xinjiang University
Dan Li: Xinjiang University
Jixiang Meng: Xinjiang University

Indian Journal of Pure and Applied Mathematics, 2021, vol. 52, issue 3, 837-846

Abstract: Abstract The edge-connectivity of a connected hypergraph H is the minimum number of edges (named as edge-cut) whose removal makes H disconnected. It is known that the edge-connectivity of a hypergraph is bounded above by its minimum degree. H is super edge-connected, if every edge-cut consists of edges incident with a vertex of minimum degree. A hypergraph H is linear if any two edges of H share at most one vertex. We call H uniform if all edges of H have the same cardinality. Sufficient conditions for equality of edge-connectivity and minimum degree of graphs and super edge-connected graphs are known. In this paper, we present a generalization of some of these sufficient conditions to linear and/or uniform hypergraphs.

Keywords: Edge-connectivity; Hypergraph; Maximally edge-connected; Super edge-connected (search for similar items in EconPapers)
Date: 2021
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s13226-021-00052-5 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:indpam:v:52:y:2021:i:3:d:10.1007_s13226-021-00052-5

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/13226

DOI: 10.1007/s13226-021-00052-5

Access Statistics for this article

Indian Journal of Pure and Applied Mathematics is currently edited by Nidhi Chandhoke

More articles in Indian Journal of Pure and Applied Mathematics from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().