Reliability analysis of circulant graphs

@article{Li1998ReliabilityAO,
  title={Reliability analysis of circulant graphs},
  author={Qiaoliang Li and Qiao Li},
  journal={Networks},
  year={1998},
  volume={31},
  pages={61-65}
}
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-l property of a graph. We evaluate the restricted edge connectivity l* and the number of i-cutsets Ni (G ) , l ° i õ l*, for any circulant graph explicitly. This improves the previous results on the subject. q 1998 John Wiley & Sons, Inc. Networks 31: 61–65… CONTINUE READING

From This Paper

Topics from this paper.

References

Publications referenced by this paper.

super-l, namely, l*(G) Å j(G) Å 6 and l*(H) Å j(H

  • F. T. Boesch
  • IEEE Trans. Reliab
  • 1986

Similar Papers

Loading similar papers…