@article{47cf71e5aec641d69b1393c875da24b8, title = "Optimal path embedding in crossed cubes", abstract = "The crossed cube is an important variant of the hypercube. The n-dimensional crossed cube has only about half diameter, wide diameter, and fault diameter of those of the n-dimensional hypercube. Embeddings of trees, cycles, shortest paths, and Hamiltonian paths in crossed cubes have been studied in literature. Little work has been done on the embedding of paths except shortest paths, and Hamiltonian paths in crossed cubes. In this paper, we study optimal embedding of paths of different lengths between any two nodes in crossed cubes. We prove that paths of all lengths between [n+1/2] + 1 and 2n - 1 can be embedded between any two distinct nodes with a dilation of 1 in the n-dimensional crossed cube. The embedding of paths is optimal in the sense that the dilation of the embedding is 1. We also prove that [n+1/ 2] is the shortest possible length that can be embedded between arbitrary two distinct nodes with dilation 1 in the n-dimensional crossed cube. {\textcopyright} 2005 IEEE.", keywords = "Crossed cube, Graph embedding, Interconnection network, Optimal embedding, Parallel computing system", author = "Jianxi Fan and Xiaola Lin and Xiaohua Jia", year = "2005", month = dec, doi = "10.1109/TPDS.2005.151", language = "English", volume = "16", pages = "1190--1200", journal = "IEEE Transactions on Parallel and Distributed Systems", issn = "1045-9219", publisher = "IEEE COMPUTER SOC", number = "12", }