20.500.12556/RUP-3760 Hamiltonian cycles in Cayley graphs whose order has few prime factors 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 ▫$24 \ne k < 32$▫, or of the form ▫$kpq$▫ with ▫$k \le 5$▫, or of the form ▫$pqr$▫, or of the form ▫$kp^2$▫ with ▫$k \le 4$▫, or of the form ▫$kp^3$▫ with ▫$k \le 2$▫. graph theory Cayley graphs hamiltonian cycles teorija grafov Cayleyjevi grafi hamiltonski cikli true true false Angleški jezik Angleški jezik Neznano 2013-10-15 12:09:08 2013-10-15 12:09:08 2024-03-01 12:11:45 0000-00-00 00:00:00 2012 0 0 str. 27-71 no. 1 Vol. 5 2012 0000-00-00 NiDoloceno NiDoloceno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 519.17 1855-3966 1024371028 RAZ_Kutnar_Klavdija_i2012.pdf RAZ_Kutnar_Klavdija_i2012.pdf 1 D8BCD5F82574FCA2EA06BADDF2D09595 4c0b662f2dfa528dfc0d8a7b591ffda838f7dfda79b9bcd8a9a4565fa71a2605 76b7f4af-c3d6-11ed-b5df-005056bf369b https://repozitorij.upr.si/Dokument.php?lang=slv&id=25905 Založba Univerze na Primorskem 0 0 0