Hamilton Cycles In Primitive Graphs of Order 2rs2rs

preprint2022arXivOpen access

Abstract

After long term efforts, it was recently proved in \cite{DKM2} that except for the Peterson graph, every connected vertex-transitive graph of order rsrs has a Hamilton cycle, where rr and ss are primes. A natural topic is to solve the hamiltonian problem for connected vertex-transitive graphs of 2rs2rs. This topic is quite trivial, as the problem is still unsolved even for that of r=3r=3. In this paper, it is shown that except for the Coxeter graph, every connected vertex-transitive graph of order 2rs2rs contains a Hamilton cycle, provided the automorphism group acts primitively on vertices.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.