On Embeddings of Circulant Graphs - Archive ouverte HAL
Article Dans Une Revue The Electronic Journal of Combinatorics Année : 2015

On Embeddings of Circulant Graphs

Résumé

A circulant of order $n$ is a Cayley graph for the cyclic group $\mathbb{Z}_n$, and as such, admits a transitive action of $\mathbb{Z}_n$ on its vertices. This paper concerns 2-cell embeddings of connected circulants on closed orientable surfaces. Embeddings on the sphere (the planar case) were classified by Heuberger (2003), and by a theorem of Thomassen (1991), there are only finitely many vertex-transitive graphs with minimum genus $g$, for any given integer $g \ge 3$. Here we completely determine all connected circulants with minimum genus 1 or 2; this corrects and extends an attempted classification of all toroidal circulants by Costa, Strapasson, Alves and Carlos (2010).

Dates et versions

hal-03468472 , version 1 (07-12-2021)

Identifiants

Citer

Marston Conder, Ricardo Grande. On Embeddings of Circulant Graphs. The Electronic Journal of Combinatorics, 2015, 22 (2), ⟨10.37236/4013⟩. ⟨hal-03468472⟩
14 Consultations
0 Téléchargements

Altmetric

Partager

More