Sufficient conditions for hypergraphs to be maximally edge-connected

Shuang Zhao and Jixiang Meng

Applied Mathematics and Computation, 2018, vol. 333, issue C, 362-368

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: Edge-connectivity; Hypergraph; Maximally edge-connected (search for similar items in EconPapers)
Date: 2018
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031830290X
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:333:y:2018:i:c:p:362-368

DOI: 10.1016/j.amc.2018.03.109

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().