Superconnectivity for minimal multi-loop networks

  • Jixiang Meng
Session 11
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1090)


We show that the minimal multi-loop networks are super-k except for undirected cycles.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1].
    R. S. Wilcov, Analysis and design of reliable computer networks, IEEE Trans, Comm COM-20 (1972), 660–678.Google Scholar
  2. [2].
    D. Smith, Graphs with the smallest number of minimum cut sets, Networks 14 (1984), 47–61.Google Scholar
  3. [3].
    F. Boesch and R. Tindell, Circulants and their connectivities, J. Graph Theory 8 (1984), 487–499.Google Scholar
  4. [4].
    E. A. van Doorn, Connectivity of circulant digraphs, J. Graph Theory 10 (1986), 9–14.Google Scholar
  5. [5].
    J. F. Wang, An investigation of network reliability properties of circulant graphs, Doctoral dissertation, Stevens Institute of Technology (1983).Google Scholar
  6. [6].
    Y. O. Hamidoune, A. S. Liado and O. Serra, The connectivity of hierarchical Cayley digraphs, Discrete Applied Math 37/38 (1992), 275–280.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1996

Authors and Affiliations

  • Jixiang Meng
    • 1
  1. 1.Institute of Mathematics and PhysicsXinjiang UniversityUrumqiP.R.China

Personalised recommendations