English

Alternating and symmetric groups with Eulerian generating graph

Group Theory 2017-05-24 v1

Abstract

Given a finite group GG, the generating graph Γ(G)\Gamma(G) of GG has as vertices the (nontrivial) elements of GG and two vertices are adjacent if and only if they are distinct and generate GG as group elements. In this paper we investigate properties about the degrees of the vertices of Γ(G)\Gamma(G) when GG is an alternating group or a symmetric group. In particular, we determine the vertices of Γ(G)\Gamma(G) having even degree and show that Γ(G)\Gamma(G) is Eulerian if and only if nn and n1n-1 are not equal to a prime number congruent to 3 modulo 4.

Keywords

Cite

@article{arxiv.1705.08202,
  title  = {Alternating and symmetric groups with Eulerian generating graph},
  author = {Andrea Lucchini and Claude Marion},
  journal= {arXiv preprint arXiv:1705.08202},
  year   = {2017}
}
R2 v1 2026-06-22T19:56:08.413Z