Some results on the solubility graph of a finite group
Abstract
Let G be a finite insoluble group with soluble radical R(G). The solubility graph S(G) of G is a simple graph whose vertices are the elements of G R(G) and two distinct vertices x and y are adjacent if and only if they generate a soluble subgroup of G. In this paper, we investigate the several properties of the solubility graph S(G).
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.