Non-Solvable Graph of a Finite Group and Solvabilizers
Abstract
Let G be a finite group. For x ∈ G, we define the solvabilizer of x in G, denoted solG(x), to be the set \g ∈ G g,x is solvable\. A group G is an S-group if solG(x) is a subgroup of G for every x ∈ G. In this paper we prove that G is solvable G is an S-group. Secondly, we define the non-solvable graph of G (denoted SG). Its vertices are G and there is an edge between x,y ∈ G whenever x,y is not solvable. If S(G) is the solvable radical of G and G is not solvable, we look at the induced graph over G S(G), denoted SG. We prove that if G is not solvable, then SG is irregular. In addition, we prove some properties of solvabilizers and non-solvable graphs.
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.