Skip to main content
SpringerLink
Log in
Book cover

International Conference on Algorithms and Architectures for Parallel Processing

ICA3PP 2012: Algorithms and Architectures for Parallel Processing pp 90–99Cite as

The Hamiltonicity of WK-Recursive Pyramid

  • Conference paper

  • 1400 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 7440))

Abstract

Fernandes and Kanevsky proposed an important structure in interconnection network, WKR Pyramid Networks (WKP(d, t, L), for short), in 1993. They are constructed by taking difference size WK-recursive network as difference layers. That paper discussed about the orders sizes and connectivity. WKP(d, L) is a simple version of WKP(d, t, L). In WKP(d, L), each vertex has exactly d children and the nth layer is isomorphic to a WK(d, n). In this paper, we show that WKP(d, L) is Hamiltonian-connected, for d ≥ 3.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Berend, D., Sapir, A.: The diameter of hanoi graphs. Information Processing Letter 98, 79–85 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  2. Buckley, F., Harary, F.: Distance in Graphs. Addisson-Wesley, Reading (1990)

    MATH  Google Scholar 

  3. Chen, G.H., Duh, D.R.: Topological properties, communication, and computation on wk-recursive network. Networks 24(6), 303–317 (1994)

    Article  MathSciNet  Google Scholar 

  4. Fernandes, R.: Recursive interconnection networks for multicomputer networks. In: Proceedings of the 1992 International Conference on Parallel Processing, vol. I, pp. 76–79 (1992)

    Google Scholar 

  5. Fernandes, R., Kanevsky, A.: Hierarchical wk-recursive topologies for multicomputer systems. In: Proceedings of the 1993 International Conference on Parallel Processing, vol. I, pp. 315–318 (1993)

    Google Scholar 

  6. Fu, J.S., Chen, G.H.: Hamiltonicity of the hierarchical cubic network. Theory of Computing Systems 35(1), 59–79 (2002)

    MathSciNet  MATH  Google Scholar 

  7. Fu, J.-S.: Hamiltonicity of the wk-recursive network with and without faulty nodes. IEEE Transactions on Parallel and Distribured Systems 16(9), 853–865 (2005)

    Article  Google Scholar 

  8. Lu, X.M.: Towers of hanoi graphs. International Journal Computer Mathematics 19, 23–28 (1986)

    Article  MATH  Google Scholar 

  9. Razavi, S., Sarbazi-Azad, H.: The triangular pyramid: Routing and topological properties. Information Sciences 180, 2328–2339 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  10. Romik, D.: Shortest paths in the tower of hanoi graph and finite automata. SIAM Journal on Discrete Mathematic 20, 610–622 (2003)

    Article  MathSciNet  Google Scholar 

  11. Zivkovic, D.: Hamiltonianicity of the tower of hanoi problem. Univ. Beograd. Publ. Elektrotehn. Fak. Ser. Mat. 17, 31–37 (2006)

    MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, National Chi Nan University, Nantou, R.O.C.

    Yi-Chun Wang & Justie Su-Tzu Juan

Authors
  1. Yi-Chun Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Justie Su-Tzu Juan
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information Technology, Deakin University, Melbourne Burwood Campus, 221 Burwood Highway, 3125, Burwood, VIC, Australia

    Yang Xiang

  2. SEECS, University of Ottawa, 8, King Edward Ave, K1N 6N5, Ottawa, ON, Canada

    Ivan Stojmenovic

  3. Department of Intelligent Informatics, Kyushu Sangyo University, 2-3-1 Matsukadai, Higashi-ku, 813-8503, Fukuoka, Japan

    Bernady O. Apduhan

  4. School of Information Science and Engineering, Central South University, 410083, Changsha, Hunan Province, P.R. China

    Guojun Wang

  5. Department of Information Engineering, Hiroshima University, 1-4-1, Kagamiyama, 739-8527, Higashi-Hiroshima, Japan

    Koji Nakano

  6. School of Information Technologies, University of Sydney, Building J12, 2006, Sydney, NSW, Australia

    Albert Zomaya

Rights and permissions

Reprints and permissions

Copyright information

© 2012 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Wang, YC., Juan, J.ST. (2012). The Hamiltonicity of WK-Recursive Pyramid. In: Xiang, Y., Stojmenovic, I., Apduhan, B.O., Wang, G., Nakano, K., Zomaya, A. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2012. Lecture Notes in Computer Science, vol 7440. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-33065-0_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-33065-0_10

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-33064-3

  • Online ISBN: 978-3-642-33065-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation