Finite vertex-primitive edge-transitive metacirculants. (Q472632): Difference between revisions
From MaRDI portal
Latest revision as of 08:23, 9 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Finite vertex-primitive edge-transitive metacirculants. |
scientific article |
Statements
Finite vertex-primitive edge-transitive metacirculants. (English)
0 references
19 November 2014
0 references
Let \(\Gamma=(V,E)\) be a connected, undirected, simple graph. Then \(\Gamma\) is called a metacirculant if its automorphism group \(\Aut(\Gamma)\) contains a metacyclic group \(R\) which is transitive on the vertex set \(V\) (that is, \(R\) is a cyclic extension of a cyclic normal subgroup). It is a long standing problem to characterize metacirculants for which \(\Aut(\Gamma)\) is transitive on the edge set \(E\). The main result of the present paper is to solve this problem in the case that \(\Aut(\Gamma)\) acts primitively on \(V\). More precisely, assume that \(G\) is a subgroup of \(\Aut(\Gamma)\) such that \(R\leq G\) and that \(G\) is both transitive on \(E\) and primitive on \(V\), then there are nine classes of metacirculants which can arise. In particular, \(\Gamma\) is a Cayley graph except in the following cases: (i) \(\Gamma\) is the line graph of the complete graph \(K_p\) (or the complement of this line graph) for some prime \(p\equiv 1\pmod 4\); (ii) \(R=\mathbb Z_{17}:\mathbb Z_8\) and \(\Aut(\Gamma)=\mathrm{P}\Gamma\)L
0 references
metacirculants
0 references
edge transitive graphs
0 references
primitive permutation groups
0 references
0 references
0 references