Browse > Article

One-to-One Disjoint Path Covers in Recursive Circulants  

박정흠 (가톨릭대학교 컴퓨터정보공학부)
Publication Information
Journal of KIISE:Computer Systems and Theory / v.30, no.12, 2003 , pp. 691-698 More about this Journal
Abstract
In this paper, we propose a problem, called one-to-one disjoint path cover problem, whether or not there exist k disjoint paths joining a pair of vertices which pass through all the vertices other than the two exactly once. A graph which for an arbitrary k, has a one-to-one disjoint path cover between an arbitrary pair of vertices has a hamiltonian property stronger than hamiltonian-connectedness. We investigate this problem on recursive circulants and prove that for an arbitrary k $k(1{\leq}k{\leq}m)$$ G(2^m,4)$,$m{\geq}3$, has a one-to-one disjoint path cover consisting of k paths between an arbitrary pair of vortices.
Keywords
disjoint path; path cover; strong hamiltonicity; recursive circulant;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 H. Enomoto and K. Ota, 'Partitions of a graph into paths with prescribed endvertices and lengths,' Journal of Graph Theory, vol. 34(2), pp. 163-169, June 2000   DOI   ScienceOn
2 J.-H. Park and K.-Y. Chwa, 'Recursive circulants and their embeddings among hypercubes,' Theoretical Computer Science, vol. 244, pp. 35-62, Aug. 2000   DOI   ScienceOn
3 C. Kim, J. Choi and H.-S. Lim, 'Embedding Full Ternary Trees into Recursive Circulants.' Lecture Notes in Computer Science 2510, pp. 874-882, 2001
4 J.-H. Park, 'Hamiltonian decomposition of recursive circulants,' International Symposium on Algorithms and Computation ISAAC'98 (LNCS #1533), Taejon, Korea, pp. 297-306, Dec. 1998
5 Y.-C. Chen, J.J.M. Tan, L.-H. Hsu, and S.-S. Kao, 'Super-connectivity and super-edge-connectivity for some interconnection networks,' Applied Mathematics and Computation, vol. 140, pp. 245-254, Aug. 2003   DOI   ScienceOn
6 M.E. Muzychuk and G. Tinhof, 'Recognizing circulant graphs in polynomial time: An application of association schemes,' The Electronic Journal of Combinatorics, vol. 8, #R26, 2001
7 C-H. Tsai; J.M. Tan, Y.-C.Chuang, and L.-H. Hsu, 'Fault-free cycles and links in faulty recursive circulant graphs,' in Proc. of Workshop on Algorithms and Theory of Computation ICS2000, pp. 74-77, 2000
8 H.-S. Lim, J.-H. Park and K.-Y. Chaw, 'Embedding trees into recursive circulants,' Discrete Applied Mathematics, vol. 69, pp. 83-99, 1996   DOI   ScienceOn
9 G. Fertin and A. Raspaud, 'Recognizing Recursive Circulant Graphs G(cd^m,d),' preprint 2002
10 C. Micheneau, 'Disjoint Hamiltonian cycles in recursive circulant graphs,' Information Processing Letters, vol. 61, pp. 259-264, Mar. 1997   DOI   ScienceOn
11 D.K.Biss, 'Hamiltonian decomposition of recursive circulant graphs,' Discrete Mathematics, vol. 214, pp. 89-99, Mar. 2000   DOI   ScienceOn
12 T. Araki and Y. Shiba, 'Pancyclicity of recursive circulant graphs,' Information processing Letters, vol. 81, pp. 187-190, Feb. 2002   DOI   ScienceOn
13 F. Harary and M. Lewinter, 'The starlike trees which span a hypercube,' Computers & Mathematics with Applications, vol. 15(4), pp. 299-302, 1988   DOI   ScienceOn
14 J.A. Bondy and U.S.R. Murty, Graph Theory with Applications, 5th Printing, American Elsevier Publishing Co. Inc., 1976
15 Y. Ishigami, 'The wide-diameter of the n-dimensional toroidal mesh,' Networks, vol. 27, pp. 257-266, 1996   DOI   ScienceOn
16 D-R. Duh and G.-H. Chen, 'On the Rabin number problem,' Networks, vol. 30(3), pp. 219-230, 1997   DOI   ScienceOn