On Hamilton paths in vertex-transitive graphs of order 10p

2024/11/26 by Shaofei Du, Du, Shaofei, Wenjuan Luo +3 · 1 citation
Computer Science · Engineering · Mathematics · #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Limits and Structures in Graph Theory #graph theory and CDMA systems

paper · pdf · doi:10.48550/arxiv.2411.17780

openalex publication_date 2024/11/26 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

It was shown by Kutnar, Maru\v si\v c and Zhang in 2012 that every connected vertex-transitive graph of order 10p, where p is a prime and p≠ 7, contains a Hamilton path, except for graphs X arising from the action of PSL(2, s^m) on cosets of ℤ_s^m\rtimes ℤ_(s^m-1)/(10), where s is a prime. In this paper, Hamilton cycles of these exceptions X will be found.

Cited by

• Hamilton Cycles In Vertex-Transitive Graphs of Order 10p

Related

• Hamilton Cycles In Vertex-Transitive Graphs of Order 10p
• Hamilton cycles in vertex-transitive graphs of order 6p
• Hamilton Paths and Cycles in Vertex-Transitive Graphs of Order 6p
• Hamilton cycles in vertex-transitive graphs of order a product of two\n primes
• Hamiltonicity of Vertex-Transitive Graphs of Order 4p