On finite edge transitive graphs and rotary maps (Q947731)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On finite edge transitive graphs and rotary maps |
scientific article; zbMATH DE number 5349239
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On finite edge transitive graphs and rotary maps |
scientific article; zbMATH DE number 5349239 |
Statements
On finite edge transitive graphs and rotary maps (English)
0 references
7 October 2008
0 references
Let \(X\) be a subgroup of the automorphism group of a graph \(\Gamma\). Then \(\Gamma\) is called, respectively, \(X\)-vertex transitive, \(X\)-edge transitive or \(X\)-arc transitive if \(X\) is transitive on the vertex-set, the edge-set or the arc-set of \(\Gamma\). If \(X\) is transitive on the vertices and the edges but not on the arcs, then \(\Gamma\) is called \(X\)-half-arc transitive. A graph \(\Gamma\) is a Cayley graph if for some subset \(S\) of a group with \(S^{-1}=S\) and \(\langle S \rangle =G\), the vertices of \(\Gamma\) can be identified with the elements of \(G\) such that the edges are \(\{x,sx\}\) for all \(x \in G\) and \(s \in S\). In this case, the right action of \(G\) on itself is a subgroup of the automorphism group of \(\Gamma\). This permutation representation of \(G\) is denoted by \(\hat{G}\). If the normaliser of \(\hat{G}\) in Aut\((\Gamma)\) is transitive on the edges or the arcs of \(\Gamma\), then \(\Gamma\) is said to be a normal edge transitive or a normal arc transitive Cayley graph, respectively. Let \(\Gamma\) be an \(X\)-vertex transitive graph and \(N\) a normal subgroup of \(X\) which is intransitive on the vertices of \(\Gamma\), and let \(\mathcal{B}\) be the set of \(N\)-orbits on \(V(\Gamma)\). The normal quotient of \(\Gamma\), denoted by \(\Gamma_N\) is the graph with vertex-set \(\mathcal{B}\) such that \(B, B'\in \mathcal{B}\) if and only if some vertex in \(B\) is adjacent in \(\Gamma\) to some vertex in \(B'\). It is easy to see that \(X/N\) acts transitively on \(V(\Gamma_N)\). If moreover \(X/N\) acts transitively on \(E(\Gamma_N)\) and the valencies in \(\Gamma\) and \(\Gamma_N\) are equal, then \(\Gamma\) is called a normal cover of \(\Gamma_N\). This paper is very rich in techniques and results which can perhaps best be summarised by the following theorem: (1) Every connected half-arc transitive graph is a normal quotient of a connected normal edge transitive Cayley graph; and (2) There exist arc transitive graphs which are not normal quotients of any normal arc transitive Cayley graphs. Amongst the techniques the author uses is the notion of a map \(\mathcal{M}\) which is said to be rotary or regular if its automorphism group is transitive on arcs or flags, respectively, and it is called chiral if it is rotary but not regular.
0 references
Cayley graph
0 references
Cayley map
0 references
edge transitive
0 references
normal cover
0 references
rotary map
0 references
chiral map
0 references
0 references