Reliability analysis of circulant graphs

Networks

Volumn 31, Issue 2, 1998, Pages 61-65

  Li, Qiaoliang ^a,b   Li, Qiao ^b  

^a HUNAN NORMAL UNIVERSITY   (China)

^b SHANGHAI JIAO TONG UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039992140     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199803)31:2<61::AID-NET1>3.0.CO;2-H     Document Type: Article

References (7)

1. M. Ball, Complexity of network reliability computation. Networks 10 (1980) 153-165.
2. D. Bauer, F. Boesch, C. Suffel, and R. Tindell, Connectivity extremel problems in the analysis and design of probabilistic networks. The Theory and Applications of Graphs. Wiley, New York (1981) 45-54.
3. F. T. Boesch, Synthesis of reliable networks - A survey. IEEE Trans. Reliab. 35 (1986) 240-246.
4. F. T. Boesch and J. F. Wang, Super line connectivity of circulant graphs. SIAM J. Alg. Dis. Math 1 (1986) 89-98.
5. A. Esfahanian, Generalized measure of fault tolerance with application to N-cubes. IEEE Trans. Comput. 38 (1989) 1586-1590.
6. A. Esfahanian and S. Hakimi, On computing a conditional edge connectivity of a graph. Info. Process. Lett. 27 (1988) 195-199.
7. L. Lovasz, Combinational Problems and Exercises. North-Holland, Amsterdam (1979).