Commuting graph of a group action with few edges
Abstract
Let A be a group acting by automorphisms on the group G. The commuting graph (G,A) of A-orbits of this action is the simple graph with vertex set \xA : 1 x ∈ G \, the set of all A-orbits on G \1\, where two distinct vertices xA and yA are joined by an edge if and only if there exist x1∈ xA and y1∈ yA such that [x1,y1]=1. The present paper characterizes the groups G for which (G,A) is an F-graph, that is, a connected graph which contains at most one vertex whose degree is not less than three.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.