arXiv Analytics

Sign in

arXiv:1506.06488 [math.CO]AbstractReferencesReviewsResources

Automorphism Groups of Planar Graphs

Pavel Klavík, Roman Nedela

Published 2015-06-22Version 1

By Frucht's Theorem, every abstract finite group is isomorphic to the automorphism group of some graph. In 1975, Babai characterized which of these abstract groups can be realized as automorphism groups of planar graphs. In this paper, we give a more detailed description of these groups in two steps. First, we describe stabilizers of vertices in connected planar graphs as the class of groups closed under the direct product and semidirect products with symmetric, dihedral and cyclic groups. Second, the automorphism group of a connected planar graph is obtained as semidirect product of a direct product of these stabilizers with a spherical group. Our approach connects automorphism groups with geometry of planar graphs and it is based on a reduction to 3-connected components, described by Fiala et al. [ICALP 2014].

Comments: arXiv admin note: substantial text overlap with arXiv:1503.06556
Categories: math.CO, cs.DM, math.GR
Related articles: Most relevant | Search more
arXiv:1006.2493 [math.CO] (Published 2010-06-12)
Diameter Bounds for Planar Graphs
arXiv:2110.08870 [math.CO] (Published 2021-10-17, updated 2022-06-21)
Gallai's path decomposition in planar graphs
arXiv:1904.06696 [math.CO] (Published 2019-04-14)
On bipartite distance-regular Cayley graphs with diameter $3$