World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

Super Edge-Connected Linear Hypergraphs

    This article is part of the issue:

    A connected graph G is super edge-connected, if every minimum edge-cut of G 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 r-uniform and linear hypergraph with diameter at most 2 to be super edge-connected is given.

    References

    • 1. F. T. Boesch and R. Tindell, Circulants and their connectivity, Journal of Graph Theory 8 (2006) 487–499. CrossrefGoogle Scholar
    • 2. G. Chartrand, A graph-theoretic approach to a communication problem, Siam Journal on Applied Mathematics 14 (1966) 778–781. Crossref, ISIGoogle Scholar
    • 3. P. Dankelmann and D. Meierling, Maximally edge-connected hypergraphs, Discrete Mathematics 339 (2016) 33–38. Crossref, ISIGoogle Scholar
    • 4. P. Dankelmann and L. Volkmann, Degree sequence conditions for maximally edge-connected graphs and digraphs, Journal of Graph Theory 19 (1997) 1255–1260. Google Scholar
    • 5. M. A. Fiol, On super-connected digraphs and bipartite digraphs, Journal of Graph Theory 16 (1992) 545–555. Crossref, ISIGoogle Scholar
    • 6. A. Hellwig and L. Volkmann, Maximally edge-connected digraphs, The Australasian Journal of Combinatorics 27 (2003) 23–32. Google Scholar
    • 7. A. Hellwig and L. Volkmann, Maximally edge-connected graphs and digraphs — A survey, Discrete Mathematics 308 (2008) 3265–3296. Crossref, ISIGoogle Scholar
    • 8. A. K. Kelmans, Asymptotic formulas for the probability of k-connectedness of random graphs, Theory of Probability and Its Applications 17 (1972) 243–254. CrossrefGoogle Scholar
    • 9. L. Lesníak, Results on the edge-connectivity of graphs, Discrete Mathematics 8 (1974) 351–354. CrossrefGoogle Scholar
    • 10. Y. Q. Wang and Q. Li, Super edge-connectivity properties of graphs with diameter 2, Journal of Shanghai Jiaotong University 33 (1999) 646–649. Google Scholar
    • 11. J. Plesník, Critical graphs of given diameter, Acta Fac. Rerum Natur. Univ. Comenian. Math. 30 (1975) 71–93. Google Scholar
    • 12. H. Whitney, Congruent graphs and the connectivity of graphs, American Journal of Mathematics 54 (1932) 150–168. CrossrefGoogle Scholar