Article citationsMore>>

R. Y. Wu, G. Chen, Y-L. Kuo and G. J. Chang,“Node- disjoint Paths in Hierarchical Hypercube Networks,”Information Sciences, Vol. 177, No. 19, 2007, pp. 4200-4207.

has been cited by the following article:

• 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.