Reliability analysis of circulant graphs

Journal Article


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

Related Topics

Related Publications

Related Content

Site Footer


This website is provided by John Wiley & Sons Limited, The Atrium, Southern Gate, Chichester, West Sussex PO19 8SQ (Company No: 00641132, VAT No: 376766987)

Published features on are checked for statistical accuracy by a panel from the European Network for Business and Industrial Statistics (ENBIS)   to whom Wiley and express their gratitude. This panel are: Ron Kenett, David Steinberg, Shirley Coleman, Irena Ograjenšek, Fabrizio Ruggeri, Rainer Göb, Philippe Castagliola, Xavier Tort-Martorell, Bart De Ketelaere, Antonio Pievatolo, Martina Vandebroek, Lance Mitchell, Gilbert Saporta, Helmut Waldl and Stelios Psarakis.