تقرير
Hamiltonian cycles in Cayley graphs whose order has few prime factors
العنوان: | Hamiltonian cycles in Cayley graphs whose order has few prime factors |
---|---|
المؤلفون: | Kutnar, K., Marusic, D., Morris, D. W., Morris, J., Sparl, P. |
سنة النشر: | 2010 |
المجموعة: | Mathematics |
مصطلحات موضوعية: | Mathematics - Combinatorics, 05C25, 05C45 |
الوصف: | We prove that if Cay(G;S) is a connected Cayley graph with n vertices, and the prime factorization of n is very small, then Cay(G;S) has a hamiltonian cycle. More precisely, if p, q, and r are distinct primes, then n can be of the form kp with k < 32 and k not equal to 24, or of the form kpq with k < 6, or of the form pqr, or of the form kp^2 with k < 5, or of the form kp^3 with k < 3. Comment: 44 pages, 1 figure, to appear in Ars Mathematica Contemporanea; new title and minor revisions suggested by the referees |
نوع الوثيقة: | Working Paper |
URL الوصول: | http://arxiv.org/abs/1009.5795 |
رقم الأكسشن: | edsarx.1009.5795 |
قاعدة البيانات: | arXiv |
الوصف غير متاح. |