Embedding starlike trees into hypercube-like interconnection networks

Authors:
Jung-Heum Park;Hyeong-Seok Lim;Hee-Chul Kim
Affiliations:
School of Computer Science and Information Engineering, The Catholic University of Korea, Korea;School of Electronics and Computer Engineering, Chonnam National University, Korea;Computer Science and Information Communications Engineering Division, Hankuk University of Foreign Studies, Korea
Venue:
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
Year:
2006

Citing 5
Cited 1

Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Spanning caterpillars of a hypercube

Journal of Graph Theory
Spanning graphs of hypercubes: starlike and double starlike trees

Discrete Mathematics - Algebraic and topological methods in graph theory
Hamiltonian properties on the class of hypercube-like networks

Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Fault-Hamiltonicity of Hypercube-Like Interconnection Networks

IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01

Embedding algorithms for bubble-sort, macro-star, and transposition graphs

NPC'10 Proceedings of the 2010 IFIP international conference on Network and parallel computing

Quantified Score

Hi-index	0.00

Visualization

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.