Affiliation:
1. School of Mathematical Sciences, Shanxi University, Taiyuan, Shanxi 030006, China
Abstract
A connected graph [Formula: see text] is super edge-connected, if every minimum edge-cut of [Formula: see text] is the set of edges incident with a vertex. In this paper, the concept of super edge-connectivity of graphs is generalized to hypergraphs and a necessary and sufficient condition for an [Formula: see text]-uniform and linear hypergraph with diameter at most 2 to be super edge-connected is given.
Funder
National Natural Science Foundation of China
Publisher
World Scientific Pub Co Pte Lt
Subject
Hardware and Architecture,Theoretical Computer Science,Software