On a kind of restricted edge connectivity of graphs

Discrete Applied Mathematics

Volumn 117, Issue 1-3, 2002, Pages 183-193

  Meng, Jixiang ^a   Ji, Youhu ^b  

^a XINJIANG UNIVERSITY   (China)

^b NANKAI UNIVERSITY   (China)

Author keywords

Circulant graph; Graph; Restricted edge connectivity

Indexed keywords

EID: 84867947324     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(00)00337-1     Document Type: Article

References (9)

1. S.B. Akers, D. Horel, B. Krishanamurthy, The star graph: an attractive alternative to the n-cube, Proceedings of the International Conference on Parallel Processing, 1987, pp. 393-400.
2. D. Bauer, F. Boesch, C. Suffel, R. Tindell, Connectivity extremal problems and the design of reliable probabilistic networks, The Theory and Application of Graphs, Wiley, New York, 1981, pp. 89-98.
3. F. Boesch, and R. Tindell Circulants and their connectivities J. Graph Theory 8 1984 487 499
4. F. Boesch, and J. Wang Super line connectivity properties of circulant graphs SIAM J. Algebra Discrete Math. 1 1986 89 98
5. A. Esfahanian, and S. Hakimi On computing a conditional edge connectivity of a graph Inform. Process. Lett. 27 1988 195 199 (Pubitemid 18606921)
6. F. Harary Conditional connectivity Networks 13 1983 346 357
7. Q.L. Li, and Q. Li Reliability analysis of circulant graphs Networks 31 1998 61 65 (Pubitemid 128368408)
8. Q.L. Li, and Q. Li Super edge connectivity of connected edge symmetric graphs Networks 33 1999 157 159 (Pubitemid 129318631)
9. R. Tindell Connectivity of Cayley graphs D.Z. Du, D.F. Hsu, Combinatorial Network Theory 1996, Kluwer Academic Publishers, Dordrecht 41 64