The circulant graphs are of particular interest as models of communica
tion networks. In this work, we present new reliability analysis resul
ts for circulants based on the concept of restricted edge connectivity
, which generalizes the super-X property of a graph. We evaluate the r
estricted edge connectivity lambda' and the number of i-cutsets N-i(G)
, lambda less than or equal to i < lambda', for any circulant graph ex
plicitly. This improves the previous results on the subject. (C) 1998
John Wiley & Sons, Inc.