Excluded power graphs of groups
Abstract
Let X be a set of integers greater than one. The X-excluded power graph of a group G has vertex set G and an edge from g to each power of g other than itself provided that the power is not divisible by any element of X. When G=H× K for groups H and K with coprime orders, excluding the prime factors of |H| yields a power graph with a quotient consisting of multiple copies of a quotient of the power graph (no exclusions) of K. Partial results for the semidirect product under the same conditions are given. We describe groups whose X-excluded power graphs consist of disjoint directed cliques.
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.