Strong Hamiltonicity of Recursive Circulants
Jeong-Heum Park · Jeongbo gwahaghoe nonmunji. si'seu'tem mich i'lon · 2001
In this paper, we investigate strong hamiltonian properties of recursive circulant G(2m,2k) from the graph theory point of view. Recursive circulant is an interconnection structure for multicomputer networks proposed in [9]. We consider the problem whether G(2m,2k) has a path of length l joining a pair of vortices v and H, and show that (a) G(2m,2) has a path of length l forany l≥d(w,w), (b) G(2m,4) has a path of length l for any l≥d(v,w) + 2, (c) for some pair of vertices in G(2m,2k), k≥3, there is no path of length d(v, w) + 2k-3, where d(v, w) is the distance from v to w.