Hamilton cycles in restricted and incomplete rotator graphs

Journal of Graph Algorithms and Applications

Volumn 16, Issue 4, 2012, Pages 785-810

  Stevens, Brett ^a   Williams, Aaron ^b  

^a CARLETON UNIVERSITY   (Canada)

^b MCGILL UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH DATABASES; GRAPHIC METHODS; ROTATION;

BUILDING OPERATIONS; CAYLEY-GRAPHS; HAMILTON CYCLE; STRONGLY CONNECTED; TIME ALGORITHMS; WILLIAMS;

DIRECTED GRAPHS;

EID: 84869845912     PISSN: 15261719     EISSN: None     Source Type: Journal    
DOI: 10.7155/jgaa.00278     Document Type: Article

References (25)

1. Y. Cheng, Generating Combinations by Three Basic Operations, Journal of Computer Science and Technology, 22 (2007) 909-91
2. R.C. Compton and S.G. Williamson, Doubly Adjacent Gray Codes for the Symmetric Group, Linear and Multilinear Algebra, 35 3 (1993) 237-293.
3. P. F. Corbett, Rotator Graphs: An Efficient Topology for Point-to-Point Multiprocessor Networks, IEEE Transactions on Parallel and Distributed Sys-tems, 3 (1992) 622-626.
4. P. F. Corbett and I.D. Scherson, Sorting in Mesh Connected Multiprocessors, IEEE Transactions on Parallel and Distributed Systems, 3 (1992) 626-632.
5. S. J. Curran and J. A. Gallian, Hamiltonian cycles and paths in Cayley graphs and digraphsa survey, Discrete Mathematics 156 (1996) 1-18.
6. G. Ehrlich, Loopless Algorithms for Generating Permutations, Combinations and Other Combinatorial Congurations, Journal of the ACM, 20 3 (1973) 500-513.
7. Yukihiro Hamada, Feng Bao, Aohan Mei, and Yoshihide Igarashi, Nonadap-tive Fault-Tolerant File Transmission in Rotator Graphs, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, E79-A 4 (1996) 477-482.
8. A. Holroyd, F. Ruskey, and A. Williams, Faster Generation of Shorthand Universal Cycles for Permutations, Proceedings of the 16th Annual Inter-national Computing and Combinatorics Conference, COCOON 2010), Nha Trang, Vietnam, July 19-21, LNCS, 6196 (2010) 298-307.
9. A. Holroyd, F. Ruskey, and A. Williams, Shorthand Universal Cycles for Permutations, Algorithmica, 64 2 (2012) 215-245.
10. Lih-Hsing Hsu and Cheng-Kuan Lin, Graph Theory and Interconnection Networks, CRC Press, 720 pages, 2008.
11. D.E. Knuth, The Art of Computer Programming, Volume 4, Generating All Tuples and Permutations, Fascicle 2, Addison-Wesley, 2005.
12. Chi-Jung Kuo, Chiun-Chieh Hsu, Hon-Ren Lin, and Kung-Kuei Lin An Efficient Algorithm for Minimum Feedback Vertex Sets in Rotator Graphs, Information Processing Letters, 109 9 (2009) 450-453.
13. Hon-Ren Lin and Chiun-Chieh Hsu, Topological Properties of Bi-Rotator Graphs, IEICE Transactions on Information and Systems, E86-D 10 (2003) 2172-2178.
14. I. Pak and R. Radoicic, Hamiltonian paths in Cayley graphs, Discrete Math-ematics 309 17 (2009) 5501-5508.
15. S. Ponnuswamy and V. Chaudhary, Embedding of Cycles in Rotator and Incomplete Rotator Graphs, Proceedings of the Sixth IEEE Symposium on Parallel and Distributed Processing, October 26-29 (1994) 603-610.
16. R. A. Rankin, A Campanological Problem in Group Theory, Proceedings of the Cambridge Philosophical Society, 44 (1948) 17-25.
17. F. Ruskey, M. Jiang, and A. Weston, On the Hamiltonicity of Directed Cayley Graphs (Or: A Tale of Backtracking), Discrete Applied Mathematics, 57 (1995) 75-83.
18. F. Ruskey and A. Williams, An Explicit Universal Cycle for the (n1)-Permutations of an n-set, ACM Transactions on Algorithms, 6 3 (2010) article 45.
19. J. Siegel, Interconnection Networks for Large-Scale Parallel Processing: Theory and Case Studies, Mcgraw-Hill, 320 pages, 1990.
20. B. Stevens and A. Williams, Hamilton Cycles in Restricted Rotator Graphs, Proceedings of the 22nd Annual International Workshop on Combinatorial Algorithms, IWOCA 2011), Victoria, Canada, June 20-22, LNCS, 7056 (2011) 324-336.
21. R. G. Swan, A Simple Proof of Rankin's Campanological Theorem, Ameri-can Mathematical Monthly, 106 2 (1999) 159-161.
22. A. Williams, Loopless Generation of Multiset Permutations Using a Con-stant Number of Variables by Prex Shifts, Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009, New York, NY, USA, January 4-6 (2009) 987-996.
23. A. Williams, Shift Gray Codes, Ph.D. thesis, University of Victoria, 2009.
24. D. Witte and J. Gallian, A survey: Hamiltonian cycles in Cayley graphs, Discrete Mathematics 51 (1984) 293-304.
25. Suzuki Yasuto, Kaneko Ken'Ichi, and Nakamori Mario, Node-Disjoint Paths Problem in a Rotator Graph, Joho Shori Gakkai Shinpojiumu Ron-bunshu, 14 (2003) 93-100.