Font Size: a A A

Tetravalent Cayley Graphs Of Groups Of Order 3p~2

Posted on:2008-10-18Degree:MasterType:Thesis
Country:ChinaCandidate:Y L WangFull Text:PDF
GTID:2120360215461533Subject:Basic mathematics
Abstract/Summary:PDF Full Text Request
Let G be a finite group and S a subset of G such that 1 (?) S. The Cayley (di) graph X = Cay(G, S) on G relative to S is defined to have vertex set V(X) = G and edge set E(X) = {(g,sg)|g∈G,s∈S}. A Cayley graph X = Cay(G,S) is said to be normal if R(G) is normal in AutX. Let p be a prime and p > 3, G = p = cp = b3 = 1 = [a, c], ab = c, cb = a-1c-1>, and H = p2 = b3 = 1,ab = ar>, where r (?) 1(mod p2), r3≡1(mod p2), 3|(p—1). In this paper ,we prove that all tetravalent Cayley graphs of G and H are normal by a combination of group theoretical and combinatorial method. As a byproduct, we obtain an infinite family of 4-valent one-regular graphs of order 3p2.
Keywords/Search Tags:Cayley graph, normal Cayley graph, one-regular graph
PDF Full Text Request
Related items