On Embedding of m-Sequential k-ary Trees into Hypercubes - Applied Mathematics

AM > Vol.1 No.6, December 2010

On Embedding of m-Sequential k-ary Trees into Hypercubes ()

HTML

Download as PDF (Size: 150KB) PP. 499-503

DOI: 10.4236/am.2010.16065 5,777 Downloads 10,681 Views Citations

Author(s)

Indra Rajasingh, Bharati Rajan, Ramanathan Sundara Rajan

Affiliation(s)

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.

KEYWORDS

Hypercube, Embedding, Dilation, Pre-order Labeling, Hamiltonian Cycle, k-ary Tree

Share and Cite:

I. Rajasingh, B. Rajan and R. Rajan, "On Embedding of m-Sequential k-ary Trees into Hypercubes," Applied Mathematics, Vol. 1 No. 6, 2010, pp. 499-503. doi: 10.4236/am.2010.16065.

Journals Menu