𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Maps and Half-transitive Graphs of Valency 4

✍ Scribed by D Marušič; R Nedela


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
167 KB
Volume
19
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

✦ Synopsis


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 correspondence between regular maps and 1 2 -transitive group actions on graphs of valency 4 is studied 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 irreflexible regular map. This way infinite 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 irreflexible 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.


📜 SIMILAR VOLUMES


Half-transitive graphs of valency 4 with
✍ Maru?i?, Dragan; Waller, Adrian O. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 134 KB 👁 2 views

A graph X is said to be 1 2 -transitive if its automorphism group Aut X acts vertex-and edge-, but not arc-transitively on X. Then Aut X induces an orientation of the edges of X. If X has valency 4, then this orientation gives rise to so-called alternating cycles, that is even length cycles in X who

Tetravalent half-edge-transitive graphs
✍ Xiuyun Wang; Yan-Quan Feng 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 206 KB

Let X be a vertex-transitive graph, that is, the automorphism group Aut(X ) of X is transitive on the vertex set of X . The graph X is said to be symmetric if Aut(X ) is transitive on the arc set of X . Suppose that Aut(X ) has two orbits of the same length on the arc set of X . Then X is said to be