The k-restricted edge connectivity of undirected Kautz graphs

Discrete Mathematics

Volumn 309, Issue 13, 2009, Pages 4649-4652

  Wang, Shiying ^a   Lin, Shangwei ^a  

^a SHANXI UNIVERSITY   (China)

Author keywords

Restricted edge connectivity; Undirected Kautz graph

Indexed keywords

EDGE CONNECTIVITIES; K-RESTRICTED EDGE CONNECTIVITIES; NETWORK RELIABILITIES; RESTRICTED EDGE CONNECTIVITY; UNDIRECTED KAUTZ GRAPH; UPPER BOUNDS;

EID: 67349174186     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2009.02.004     Document Type: Article

References (20)

1. Balbuena C., Cera M., Diánez A., García-Vázquez P., and Marcote X. Diameter-girth sufficient conditions for optimal extraconnectivity in graphs. Discrete Math. 308 (2008) 3526-3536
2. ′-optimality in graphs with girth g. J. Graph Theory 52 (2006) 73-86
3. Bermond J.C., and Peyrat C. De Bruijn and Kautz networks: A competitor for the hypercube?. Hypercube Distrib. Comput. 3 (1989) 279-293
4. Bondy J.A., and Murty U.S.R. Graph Theory (2007), Springer, New York
5. Bonsma P., Ueffing N., and Volkmann L. Edge-cuts leaving components of order at least three. Discrete Math. 256 (2002) 431-439
6. Esfahanian A.H., and Hakimi S.L. On computing a conditional edge-connectivity of a graph. Inform. Process. Lett. 27 (1988) 195-199
7. Fan Y.M. Restricted edge-connectivity of a kind of Kautz graphs. J. Guangxi Norm. Univ. Nat. Sci. Ed. 21 (2004) 36-38 (in Chinese)
8. Fiol M.A., Yebra J.L.A., and De Miquel I.A. Line digraph iterations and the (d, k) digraph problem. IEEE Trans. Comput. 33 5 (1984) 400-403
9. ′-optimal super-edge-connected, and maximally edge-connected. J. Graph Theory 48 (2005) 228-246
10. Meng J.X. Optimally super-edge-connected transitive graphs. Discrete Math. 260 (2003) 239-248
11. Meng J.X., and Ji Y.H. On a kind of restricted edge connectivity of graphs. Discrete Appl. Math. 117 (2002) 183-193
12. Ou J.P. Edge cuts leaving components of order at least m. Discrete Math. 305 (2005) 365-371
13. Ou J.P., Cheng X.H., and Wu J.C. On 3-restricted edge connectivity of undirected binary Kautz graphs. Discrete Math. 309 (2009) 629-638
14. Ou J.P., and Zhang F.J. The super restricted edge connectivity of graphs. Acta Math. Sin. 47 (2004) 931-940 (in Chinese)
15. Ravikumar C.P., Rai T., and Verma V. Kautz graphs as attractive logical topologies in multihop lightwave networks. Comput. Commun. 20 (1997) 1259-1270
16. Wang M., and Li Q. Conditional edge connectivity properties, reliability comparison and transitivity of graphs. Discrete Math. 258 (2002) 205-214
17. Wang S.Y., and Lin S.W. The maximal restricted edge connectivity of Kautz undirected graphs (extended abstract). Electron. Notes Discrete Math. 22 (2005) 49-53
18. Wang S.Y., Lin S.W., and Li C.F. Sufficient conditions for super k-restricted edge connectivity in graphs of diameter 2. Discrete Math. 309 (2009) 908-919
19. Zhang Z., and Yuan J.J. A proof of an inequality concerning k-restricted edge connectivity. Discrete Math. 304 (2005) 128-134
20. Zhang Z., and Yuan J.J. Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal. Discrete Math. 307 (2007) 293-298