Skip to main content
SpringerLink
Log in

Superconnectivity for minimal multi-loop networks

  • Session 11
  • Conference paper
  • First Online:
Computing and Combinatorics (COCOON 1996)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1090))

Included in the following conference series:

  • 156 Accesses

Abstract

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

Supported by the Natural Foundation of China, Xinjiang Educational Committee and Xinjiang University

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

References

  1. R. S. Wilcov, Analysis and design of reliable computer networks, IEEE Trans, Comm COM-20 (1972), 660–678.

    Google Scholar 

  2. D. Smith, Graphs with the smallest number of minimum cut sets, Networks 14 (1984), 47–61.

    Google Scholar 

  3. F. Boesch and R. Tindell, Circulants and their connectivities, J. Graph Theory 8 (1984), 487–499.

    Google Scholar 

  4. E. A. van Doorn, Connectivity of circulant digraphs, J. Graph Theory 10 (1986), 9–14.

    Google Scholar 

  5. J. F. Wang, An investigation of network reliability properties of circulant graphs, Doctoral dissertation, Stevens Institute of Technology (1983).

    Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Physics, Xinjiang University, 830046, Urumqi, P.R.China

    Jixiang Meng

Authors
  1. Jixiang Meng
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jin-Yi Cai Chak Kuen Wong

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Meng, J. (1996). Superconnectivity for minimal multi-loop networks. In: Cai, JY., Wong, C.K. (eds) Computing and Combinatorics. COCOON 1996. Lecture Notes in Computer Science, vol 1090. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61332-3_176

Download citation

  • DOI: https://doi.org/10.1007/3-540-61332-3_176

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61332-9

  • Online ISBN: 978-3-540-68461-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation