Premium
Reliability analysis of circulant graphs
Author(s) -
Li Qiaoliang,
Li Qiao
Publication year - 1998
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/(sici)1097-0037(199803)31:2<61::aid-net1>3.0.co;2-h
Subject(s) - circulant matrix , circulant graph , reliability (semiconductor) , combinatorics , enhanced data rates for gsm evolution , computer science , graph theory , graph , discrete mathematics , mathematics , line graph , artificial intelligence , voltage graph , power (physics) , physics , quantum mechanics
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 N i ( 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