Table of Contents
Fetching ...

Hamilton cycles in vertex-transitive graphs of order $6p$

Shaofei Du, Tianlei Zhou

Abstract

It was shown by Kutnar and \v Sparl in 2009 that every connected vertex-transitive graph of order $6p$, where $p$ is a prime, contains a Hamilton path. In this paper, it will be shown that every such graph contains a Hamilton cycle, except for the triangle-replaced graph of the Petersen graph.

Hamilton cycles in vertex-transitive graphs of order $6p$

Abstract

It was shown by Kutnar and \v Sparl in 2009 that every connected vertex-transitive graph of order , where is a prime, contains a Hamilton path. In this paper, it will be shown that every such graph contains a Hamilton cycle, except for the triangle-replaced graph of the Petersen graph.
Paper Structure (10 sections, 30 theorems, 17 equations, 2 figures)

This paper contains 10 sections, 30 theorems, 17 equations, 2 figures.

Key Result

Theorem 1.1

Except for the graph obtained from the Petersen graph by replacing each vertex by a triangle, every connected vertex-transitive graph of order $6p$ contains a Hamilton cycle, where $p$ is a prime.

Figures (2)

  • Figure 1: The quotient graph $X_{\mathcal{S}}$ with respect to the $(6,p)$-semiregular automorphism $\rho=s(0,1)$ when $\beta^{t^i\ell H}\subset N_1(\alpha)$.
  • Figure 2: The quotient graph $X_{\mathcal{S}}$ with respect to the $(6,p)$-semiregular automorphism $\rho=s(0,1)$ when $\alpha^{t^j\ell H}\cup\beta^{t^{i}H}\subset N_1(\alpha)$.

Theorems & Definitions (32)

  • Theorem 1.1
  • Proposition 2.1
  • Proposition 2.2
  • Proposition 2.3
  • Proposition 2.4
  • Proposition 2.5
  • Proposition 2.6
  • Lemma 2.7
  • Proposition 2.8
  • Proposition 2.9
  • ...and 22 more