一类2—循环图的Hamilton分解

HAMILTONIANDECOMPOSITIONSOF A CLASS OF 2—CIRCULANT GRAPHS

设Γ_1(n,S)和Γ_2(n,qS)是两个同构的循环图,文[1]利用这两个循环图给出了2-循环图Γ(S,q,F)的定义.当 q=1时,它简写为Γ(S,F),本文对适当的集合 S 及 F,证明了Γ(S,F)是可以 Hamilton 分解的。

Let Γ_1(n,S)and Γ_2(n,qS)be two isomorphic circulant graphs,paper uses these two circulant graphs to construct Γ(s,q,F)that is called z-circulant graphs.It is simply denoted by Γ(S,F)when.q=1.In this paper,for suitable sets S and F,we prove that Γ(S,F)can be decomposed into Hamiltonian circuits.