Reliability analysis of circulant graphs

• Published in: Networks Vol. 31; no. 2; pp. 61 - 65
• Main Authors: Li, Qiaoliang, Li, Qiao
• Format: Journal Article
• Language: English
• Published: New York Wiley Subscription Services, Inc., A Wiley Company 01.03.1998; John Wiley & Sons
• Subjects: Applied sciences; Computer science; control theory; systems; Exact sciences and technology; Information retrieval. Graph; Office automation, teleprocessing; Software; Theoretical computing; Connected graph; Graph theory; Computer network; Communication network; Non directed graph; Remote data processing
• ISSN: 0028-3045; 1097-0037
• DOI: 10.1002/(SICI)1097-0037(199803)31:2<61::AID-NET1>3.0.CO;2-H

The circulant graphs are of particular interest as models of communication networks. In this work, we present new reliability analysis results for circulants based on the concept of restricted edge connectivity, which generalizes the super‐λ property of a graph. We evaluate the restricted edge connectivity λ′ and the number of i‐cutsets Ni(G), λ ≤ i < λ′, for any circulant graph explicitly. This improves the previous results on the subject. © 1998 John Wiley & Sons, Inc. Networks 31:61–65, 1998