Beyond symmetry in generalized Petersen graphs

From MaRDI portal
Publication:6152224

DOI10.1007/S10801-023-01282-YarXiv2202.06785OpenAlexW4226514554WikidataQ129522390 ScholiaQ129522390MaRDI QIDQ6152224FDOQ6152224


Authors: Ignacio García Marco, Kolja Knauer Edit this on Wikidata


Publication date: 11 March 2024

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

Abstract: A graph is a core or unretractive if all its endomorphisms are automorphisms. Well-known examples of cores include the Petersen graph and the graph of the dodecahedron -- both generalized Petersen graphs. We characterize the generalized Petersen graphs that are cores. A simple characterization of endomorphism-transitive generalized Petersen graphs follows. This extends the characterization of vertex-transitive generalized Petersen graphs due to Frucht, Graver, and Watkins and solves a problem of Fan and Xie. Moreover, we study generalized Petersen graphs that are (underlying graphs of) Cayley graphs of monoids. We show that this is the case for the Petersen graph, answering a recent mathoverflow question, for the Desargues graphs, and for the dodecahedron -- answering a question of Knauer and Knauer. Moreover, we characterize the infinite family of generalized Petersen graphs that are Cayley graph of a monoid with generating connection set of size two. This extends Nedela and v{S}koviera's characterization of generalized Petersen graphs that are group Cayley graphs and complements results of Hao, Gao, and Luo.


Full work available at URL: https://arxiv.org/abs/2202.06785




Recommendations




Cites Work






This page was built for publication: Beyond symmetry in generalized Petersen graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6152224)