Abstract
In this short note, we establish topological relationships among the folded hypercube FQ n , the even graph E k and the odd graphs O d via embedding. Such embeddings are measured via dilation.
Acknowledgements
We are grateful to the two anonymous referees for their useful comments and suggestions.
Notes
†A preliminary an abridged version of this paper was presented by Hyeong-Ok Lee at The 2008 International Conference on Parallel Distributed Processing Techniques Applications.
The Hamming distance of two binary strings of the same length is the number of bits by which they differ.
The diameter of a graph is the maximum of the length of a shortest path between u and v, computed over all pairs of vertices u and v.
Throughout this note, we use the usual notation of s 1 s 2 to denote the concatenation of the two binary strings s 1 and s 2.