Super edge-connectivity of transitive hypergraphs

Shuang Zhao, Xiaomin Hu and Weihua Yang

Applied Mathematics and Computation, 2026, vol. 509, issue C

Abstract: The properties of fragments and superatoms, first arose in the work of Mader et al., have turned out to be powerful tools in the study of graph connectivity. We generalize the concept of an edge fragment and an edge superatom to hypergraphs and reveal that these generalizations share features with the common concepts. As applications of these properties, we investigate the super edge-connectivity of uniform linear vertex transitive hypergraphs, uniform linear t-Cayley hypergraphs and linear edge transitive hypergraphs, and derive the main result of Burgess et al. [J. Graph Theory, 105(2024)252–259] as a corollary.

Keywords: Edge connectivity; Super edge-connected; Vertex transitive hypergraph; t-Cayley hypergraph; Edge transitive hypergraph (search for similar items in EconPapers)
Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300325004242
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:509:y:2026:i:c:s0096300325004242

DOI: 10.1016/j.amc.2025.129698

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 ().