Project supported by the National Natural Science Foundation of China.
Let b>1 be an integer. Aurifeuille et al. discovered a special factorization for a class of numbers in the form of bn±1. It is called Aurifeuillian factorization. Let p be an odd prime. Let ζ=ζp<...
Definition 1. Let G be a finite group, S G╲{1}and S-1={s-1|s∈G}=S. The Cayley graph on G with respect to S, written as Γ(S; G), is defined as V(Γ(S; G)), E(Γ(S; G)={g, sg)|g∈G, s...
An isomorphic factorization of a graph G=(V, E) is a partition {E1,E2,…,Et} of the edge set E such that If G has an isomorphic factorization into exactly t isomorphic subgraphs we say that G is divisible by t.