Skip to main content
SpringerLink
Log in

Embedding Starlike Trees into Hypercube-Like Interconnection Networks

  • Conference paper
Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops (ISPA 2006)

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

Abstract

A starlike tree (or a quasistar) is a subdivision of a star tree. A family of hypercube-like interconnection networks called restricted HL-graphs includes many interconnection networks proposed in the literature such as twisted cubes, crossed cubes, multiply twisted cubes, Möbius cubes, Mcubes, and generalized twisted cubes. We show in this paper that every starlike tree of degree at most m with 2m vertices is a spanning tree of m-dimensional restricted HL-graphs.

This work was supported by grant No. R05-2003-000-11506-0 from the Basic Research Program of the Korea Science & Engineering Foundation.

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

Access this chapter

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dvořák, T., Havel, I., Laborde, J.-M., Mollard, M.: Spanning caterpillars of a hypercube. J. Graph Theory 24(1), 9–19 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  2. Kobeissi, M., Mollard, M.: Spanning graphs of hypercubes: starlike and double starlike trees. Discrete Mathematics 244, 231–239 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  3. Leighton, F.T.: Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann Publishers, San Francisco (1992)

    MATH  Google Scholar 

  4. Nebeský, L.: Embedding m-quasistars into n-cubes. Czechoslovak Mathematical Journal 38(113), 705–712 (1988)

    MathSciNet  Google Scholar 

  5. Park, C.-D., Chwa, K.Y.: Hamiltonian properties on the class of hypercube-like networks. Inform. Proc. Lett. 91, 11–17 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  6. Park, J.-H., Kim, H.-C., Lim, H.-S.: Fault-hamiltonicity of hypercube-like interconnection networks. In: Proc. of the IEEE International Parallel and Distributed Processing Symposium IPDPS 2005, Denver (April 2005)

    Google Scholar 

  7. Vaidya, A.S., Rao, P.S.N., Shankar, S.R.: A class of hypercube-like networks. In: Proc. of the 5th IEEE Symposium on Parallel and Distributed Processing SPDP 1993, December 1993, pp. 800–803 (1993)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Information Engineering, The Catholic University of Korea, Korea

    Jung-Heum Park

  2. School of Electronics and Computer Engineering, Chonnam National University, Korea

    Hyeong-Seok Lim

  3. Computer Science and Information Communications Engineering Division, Hankuk University of Foreign Studies, Korea

    Hee-Chul Kim

Authors
  1. Jung-Heum Park
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Hyeong-Seok Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hee-Chul Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computing, School of Informatics, University of Bradford, BD7 1DP, Bradford, U.K.

    Geyong Min

  2. Dipartimento di Ingegneria dell’ Informazione - Second, University of Naples - Italy, Real Casa dell’Annunziata - via Roma, 29 81031, Aversa (CE), Italy

    Beniamino Di Martino

  3. Department of Computer Science, St. Francis Xavier University, Antigonish, Canada

    Laurence T. Yang

  4. Department of Computer Science and Engineering, Shanghai Jiao Tong University, 200030, Shanghai, China

    Minyi Guo

  5. Department of Computer Science, Chemnitz University of Technology, Germany

    Gudula Rünger

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Park, JH., Lim, HS., Kim, HC. (2006). Embedding Starlike Trees into Hypercube-Like Interconnection Networks. In: Min, G., Di Martino, B., Yang, L.T., Guo, M., Rünger, G. (eds) Frontiers of High Performance Computing and Networking – ISPA 2006 Workshops. ISPA 2006. Lecture Notes in Computer Science, vol 4331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11942634_32

Download citation

  • DOI: https://doi.org/10.1007/11942634_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-49860-5

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation