The restricted edge-connectivity of Kautz undirected graphs

Ars Combinatoria

Volumn 81, Issue , 2006, Pages 369-379

  Fan, Ying Mei ^a   Xu, Jun Ming ^b   Lü, Min ^b  

^a GUANGXI UNIVERSITY   (China)

^b UNIVERSITY OF SCIENCE AND TECHNOLOGY OF CHINA   (China)

Author keywords

Edge connectivity; Kautz graphs; Restricted edge connectivity; Super edge connected

Indexed keywords

EID: 33845574314     PISSN: 03817032     EISSN: 28175204     Source Type: Journal    
DOI: None     Document Type: Article

References (20)

1. D. Bauer, F. Boesch, C. Suffel and R. Tindell, Connectivity extremal problems and the design of reliable probabilistic networks. The Theory and Application of Graphs, Wiley, New York, 1981, 89-98.
2. J. C. Bermond, N. Homobono and C. Peyrat, Connectivity of Kautz networks, Discrete Math., 114(1993), 51-61.
3. J. C. Bermond and C. Peyrat, De Bruijn and Kautz networks: a competitor for the hypercube? In Hypercube and Distributed Computers (F. Andre and J. P. Verjus eds.). Horth-Holland: Elsevier Science Publishers, 1989, 278-293.
4. F. Boesch, On unreliability polynomials and graph connectivity in reliable network synthesis. J. Graph Theory, 10(1986), 339-352.
5. J. A. Bondy and U. S. R. Murty, Graph Theory with Applications. London and Basingstoke, MacMillan Press LTD, 1976.
6. P. Bonsma, N. Ueffing and L. Volkmann, Edge-cuts leaving components of order at least three. Discrete Math., 256(2002), 431-439.
7. A. H. Esfahanian, Generalized measures of fault tolerance with application to n-cube networks. IEEE Trans. Comput., 38(11) (1989), 1586-1591.
8. A. H. Esfahanina and S. L. Hakimi, On computing a edge-connectivity of a graph, Information Processing Letters, 27(1988), 195-199.
9. A. Hellwig and L. Volkmann, Sufficient conditions for λ′-optimality in graphs of diameter 2. Discrete Math., 283(2004), 113-120.
10. A. Hellwig and L. Volkmann, Sufficient conditions for graphs to be λ′-optimal, super-edge-connected and maximally edge-connected. J. Graph Theory, to appear.
11. J.-X. Meng and Y.-H. Ji, On a kind of restricted connectivity of graphs. Discrete Applied Math., 117(2002), 183-193.
12. N. Ueffing and L. Volkmann, Restricted edge-connectivity and minimum edge-degree. Ars Combin. 66(2003), 193-203.
13. M. Wang and Q. Li, Conditional edge connectivity properties, reliability comparisons and transitivity of graphs. Discrete Math., 258(1-3) (2002), 205-214.
14. Y. Wang and Q. Li, Super-edge-connectivity properties of graphs with diameter 2. J. Shanghai Jiaotong Univ., 33(6) (1999), 646-649.
15. J.-M. Xu, Restricted edge-connectivity of vertex-transitive graphs. Chinese Journal of Contemporary Math. 21(4) (2000), 369-374;
16. a version of Chinese in Chin. Ann. Math. 21A(5) (2000), 605-60 8.
17. J.-M. Xu, On conditional edge-connectivity of graphs. Acta Math. Applied Scinica, 16B(4) (2000), 414-419.
18. J.-M. Xu, Toplogical Structure and Analysis of Interconnection Networks. Kluwer Academic Publishers, Dordrecht/Boston/London, 2001.
19. J.-M. Xu, Theory and Application of Graphs. Kluwer Academic Publishers, Dordrecht/Boston/Loridon, 2003.
20. J.-M. Xu and K.-L. Xu, On restricted edge-connectivity of graphs. Discrete Math., 243(1-3) (2002), 291-298.