Font Size: a A A

The Edge-transitive Z_p×Z_p- Coverings Of Heawood Graph

Posted on:2006-02-18Degree:MasterType:Thesis
Country:ChinaCandidate:L H YangFull Text:PDF
GTID:2120360155969795Subject:Finite groups and algebraic graph theory
Abstract/Summary:PDF Full Text Request
Let graph X be a finite undirected simple graph. A graph is called edge-transitive, if AutX is transitive on the edge set E(X). A graph X is called a covering of X with a projection p : X → X, if p is a surjction from V(X) to V{X) such that P|N(v): N(v) →N(v) is a bijetion for any vertex v ∈ p-1 (X) and v ∈ V(X) . The graph X is called the covering graph and X is the base. A covering X of X with a projection p is said to be regular (or K-covering) if there is a semiregular(on E{X) and V{X)) subgroup K of the automorphism group Aut(X) such that the graph X is isomophic to the quotient graph X/K, say by h, and the quotient mapX→X/K is the composition ph of p and h (for the purpose of this paper, all funtions are composed from left to right). In this paper we discuss The Edge-transitive Zp × Zp-coverings of Heawood graph, where p is a prime. we show that p = 7 or p (?) 1(mod7), and if the voltages {e,x0} are linearly independent, and the voltages of the fundamental cycles satisfying x0 = x1 = x2= x5 = x6, x3 = x4 = -e + x0, then any such Zp ×Zp -covering is symmetric. As a result, we discuss that the Zp×ZP- coverings of Heawood graph are all 1-regular graphs, here p (?) 1(mod7), furthermore a new infinite family of cubic 1-regular graphs is constructed.
Keywords/Search Tags:Heawood graph, symmetric graph, 1-regular, lift, regular covering
PDF Full Text Request
Related items