An infinite family of cubic one-regular graphs with unsolvable automorphism groups.
type: Item
instance of: scholarly article
title: An infinite family of cubic one-regular graphs with unsolvable automorphism groups.
zbMATH Open document ID: 1035.05047
DOI: 10.1016/S0012-365X(03)00056-6
published in: Discrete Mathematics
publication date: 2003-08-19T00:00:00Z
review text: A graph \(X\) is said to be vertex-transitive, edge-transitive, and arc-transitive if its automorphism group \(\Aut(X)\) is transitiv on the vertex set, edge set and arc set, respectively. A graph is said to be one-regular if \(\Aut(X)\) acts freely and transitively on the set of arcs. The first cubic one-regular graph was constructed by Frucht in 1952. Since then there is a large number of generalizations of this result. In this paper, an infinite family of cubic one-regular graphs with solvable automorphism group is constructed.
Mathematics Subject Classification ID: 05C25
Mathematics Subject Classification ID: 20B25
zbMATH DE Number: 1967278
zbMATH Keywords: Cayley graphs
zbMATH Keywords: unsolvable groups
author: Yan-Quan Feng
author: Jin Ho Kwak
reviewed by: Ulrike Baumann
MaRDI profile type: Publication
cites work: Q4306490
cites work: Remarks on path-transitivity in finite graphs
cites work: On 1-arc-regular graphs
cites work: A One-Regular Graph of Degree Three
cites work: Constructing infinite one-regular graphs
cites work: Half-transitive group actions on finite graphs of valency 4
cites work: Maps and half-transitive graphs of valency 4
cites work: A �-transitive graph of valency 4 with a nonsolvable group of automorphisms
cites work: The trivalent symmetric graphs of girth at most six
cites work: Q5785712
cites work: Q5512231
cites work: Automorphism groups and isomorphisms of Cayley digraphs
full work available at URL: s0012-365x(03)00056-6
OpenAlex ID: W2044404675
description: scientific article; zbMATH DE number 1967278