References
- 박정흠, 좌경룡, '재귀원형군의 위상 특성 : 서로소인 사이클과 그래프 invariant', 한국정보과학회 논문지, 26(8), pp.999-1008, 1999
- 박정흠, 좌경룡, '재귀원형군의 위상 특성 : 서로소인 경로', 한국정보과학회 논문지, 26(8), pp.1009-1023, 1999
- J. A. Bondy and U. S. R. Murty, Graph Theory with Applications, 5th printing, American Elsevier Publishing Co., Inc., 1976
- C. C. Chen and N. F. Quimpo, 'On strongly Hamitonian abelian group graphs,' Lecture Notes in Mathematics 884 (Springer, Berlin), Australian Conference on Combinatorial Mathematics , pp.23-34, 1980 https://doi.org/10.1007/BFb0091805
- G. Gauyacq, C. Micheneau, and A. Raspaud, 'Routing in recursive circulant graphs : edge forwarding index and hamiltonian decomposition,' in Proc. of International Workshop on Graph-Theoretic Concepts in Computer Science WG'98, Smolenice Castle,Slovak Republic, pp.227-241, 1998 https://doi.org/10.1007/10692760_19
- R. J. Gould, 'Updating the hamiltonian problem-a survey,' Journal of Graph Theory, 15, pp. 121-157, 1991 https://doi.org/10.1002/jgt.3190150204
- C. Micheneau, 'Disjoint hamiltonian cycles in recursive circulant graphs,' Information Processing Letters 61, pp.259-264, 1997 https://doi.org/10.1016/S0020-0190(97)00020-3
- J.-H. Park, 'Hamiltonian decomposition of recursive circulants,' in Proc. International Symposium on algorithms and Computation ISAAC'98, Taejon, Korea, pp.297-306, 1998
- J.-H. Park and K.-Y. Chwa, 'Recursvie circulant : a new topology for multicomputer networks,' in Proc. International Symposium on Parallel Architectures, Algorithms and Networks ISPAN'94, Kanazawa, Japan, pp.73-80, 1994 https://doi.org/10.1109/ISPAN.1994.367162
- J.-H. Park and K.-Y. Chwa, 'Recursive circulants and their embeddings among hypercubes,' Theoretical Computer Science 244, pp.35-62, 2000 https://doi.org/10.1016/S0304-3975(00)00176-6
- D. A. Reed and R. M. Fujimoto, Multicomputer Networks : Message-Based Parallel Processing. The MIT Press, 1987