Optimal Embeddings of Paths with Various Lengths in Twisted Cubes


Twisted cubes are variants of hypercubes. In this paper, we study the optimal embeddings of paths of all possible lengths between two arbitrary distinct nodes in twisted cubes. We use TQn to denote the n-dimensional twisted cube and use dist(TQn, u, v) to denote the distance between two nodes u and v in TQn, where n ges l is an odd integer. The original… (More)
DOI: 10.1109/TPDS.2007.1003


6 Figures and Tables


Citations per Year

53 Citations

Semantic Scholar estimates that this publication has 53 citations based on the available data.

See our FAQ for additional information.

Slides referencing similar topics