TITLE:
On Embedding of m-Sequential k-ary Trees into Hypercubes
AUTHORS:
Indra Rajasingh, Bharati Rajan, Ramanathan Sundara Rajan
KEYWORDS:
Hypercube, Embedding, Dilation, Pre-order Labeling, Hamiltonian Cycle, k-ary Tree
JOURNAL NAME:
Applied Mathematics,
Vol.1 No.6,
December
27,
2010
ABSTRACT: In this paper, we present an algorithm for embedding an m-sequential k-ary tree into its optimal hypercube with dilation at most 2 and prove its correctness.