Alternating and symmetric groups with Eulerian generating graph
Abstract
Given a finite group G, the generating graph (G) of G has as vertices the (nontrivial) elements of G and two vertices are adjacent if and only if they are distinct and generate G as group elements. In this paper we investigate properties about the degrees of the vertices of (G) when G is an alternating group or a symmetric group. In particular, we determine the vertices of (G) having even degree and show that (G) is Eulerian if and only if n and n-1 are not equal to a prime number congruent to 3 modulo 4.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.