Maps, One-regular Graphs and Half-transitive Graphs of Valency 4
نویسندگان
چکیده
A subgroup G of automorphisms of a graph X is said to be 1 2-transitive if it is vertex and edge but not arc-transitive. The graph X is said to be 1 2-transitive if Aut X is 1 2-transitive. The graph X is called one-regular if Aut X acts regularly on the set arcs of X. The interplay of three diierent concepts of maps, one-regular graphs and 1 2-transitive group actions on graphs of valency 4 is investigated. The correspondence between regular maps and 1 2-transitive group actions on graphs of valency 4 is given via the well known concept of medial graphs. Among others it is proved that under certain general conditions imposed on a map, its medial graph must be a 1 2-transitive graph of valency 4, and vice-versa, under certain conditions imposed on the vertex stabilizer, a 1 2-transitive graph of valency 4 gives rise to an irreeexible regular map. This way innnite families of 1 2-transitive graphs are constructed from known examples of regular maps. Conversely , known constructions of 1 2-transitive graphs of valency 4 give rise to new examples of irreeexible regular maps. In the end, the concept of a symmetric genus of a 1 2-transitive graph of valency 4 is introduced. In particular, 1 2-transitive graphs of valency 4 and small symmetric genuses are discussed.
منابع مشابه
On symmetries of Cayley graphs and the graphs underlying regular maps
By definition, Cayley graphs are vertex-transitive, and graphs underlying regular or orientably-regular maps (on surfaces) are arc-transitive. This paper addresses questions about how large the automorphism groups of such graphs can be. In particular, it is shown how to construct 3-valent Cayley graphs that are 5-arc-transitive (in answer to a question by Cai Heng Li), and Cayley graphs of vale...
متن کاملThe maximum genus of vertex-transitive graphs
Graphs possessing a high degree of symmetry have often been considered in topological graph theory. For instance, a number of constructions of genus embeddings by means of current or voltage graphs is based on the observation that a graph can be represented as a Cayley graph for some group. Another kind of embedding problems where symmetrical graphs are encountered is connected with regular map...
متن کاملHalf-arc-transitive graphs and chiral hypermaps
A subgroup G of automorphisms of a graph X is said to be 2 -arc-transitive if it is vertexand edgebut not arc-transitive. The graph X is said to be 2 -arc-transitive if Aut X is 1 2 -arc-transitive. The interplay of two different concepts, maps and hypermaps on one side and 2 -arc-transitive group actions on graphs on the other, is investigated. The correspondence between regular maps and 2 -ar...
متن کاملHalf-arc-transitive graphs of order 4p of valency twice a prime
A graph is half-arc-transitive if its automorphism group acts transitively on vertices and edges, but not on arcs. Let p be a prime. Cheng and Oxley [On weakly symmetric graphs of order twice a prime, J. Combin. Theory B 42(1987) 196-211] proved that there is no half-arc-transitive graph of order 2p, and Alspach and Xu [ 12 -transitive graphs of order 3p, J. Algebraic Combin. 3(1994) 347-355] c...
متن کاملConstructing 12 - Transitive Graphs of Valency 4 Andvertex
An innnite familiy of 1 2-transitive graphs of valency 4 with alternating cycles of length 4 is given. Besides, an innnite family of 1 2-transitive graphs of valency 4 with vertex stabilizer isomorphic to Z 2 Z 2 , is constructed.
متن کامل