Super Edge-Connected Linear Hypergraphs
Abstract
A connected graph is super edge-connected, if every minimum edge-cut of 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 -uniform and linear hypergraph with diameter at most 2 to be super edge-connected is given.
References
- 1. , Circulants and their connectivity, Journal of Graph Theory 8 (2006) 487–499. Crossref, Google Scholar
- 2. , A graph-theoretic approach to a communication problem, Siam Journal on Applied Mathematics 14 (1966) 778–781. Crossref, ISI, Google Scholar
- 3. , Maximally edge-connected hypergraphs, Discrete Mathematics 339 (2016) 33–38. Crossref, ISI, Google Scholar
- 4. , Degree sequence conditions for maximally edge-connected graphs and digraphs, Journal of Graph Theory 19 (1997) 1255–1260. Google Scholar
- 5. , On super-connected digraphs and bipartite digraphs, Journal of Graph Theory 16 (1992) 545–555. Crossref, ISI, Google Scholar
- 6. , Maximally edge-connected digraphs, The Australasian Journal of Combinatorics 27 (2003) 23–32. Google Scholar
- 7. , Maximally edge-connected graphs and digraphs — A survey, Discrete Mathematics 308 (2008) 3265–3296. Crossref, ISI, Google Scholar
- 8. , Asymptotic formulas for the probability of k-connectedness of random graphs, Theory of Probability and Its Applications 17 (1972) 243–254. Crossref, Google Scholar
- 9. , Results on the edge-connectivity of graphs, Discrete Mathematics 8 (1974) 351–354. Crossref, Google Scholar
- 10. , Super edge-connectivity properties of graphs with diameter 2, Journal of Shanghai Jiaotong University 33 (1999) 646–649. Google Scholar
- 11. , Critical graphs of given diameter, Acta Fac. Rerum Natur. Univ. Comenian. Math. 30 (1975) 71–93. Google Scholar
- 12. , Congruent graphs and the connectivity of graphs, American Journal of Mathematics 54 (1932) 150–168. Crossref, Google Scholar


