Non-Solvable Graph of a Finite Group and Solvabilizers
Group Theory
2013-07-12 v1
Abstract
Let be a finite group. For , we define the solvabilizer of in , denoted , to be the set is solvable. A group is an S-group if is a subgroup of for every . In this paper we prove that is solvable is an S-group. Secondly, we define the non-solvable graph of (denoted ). Its vertices are and there is an edge between whenever is not solvable. If is the solvable radical of and is not solvable, we look at the induced graph over , denoted . We prove that if is not solvable, then is irregular. In addition, we prove some properties of solvabilizers and non-solvable graphs.
Keywords
Cite
@article{arxiv.1307.2924,
title = {Non-Solvable Graph of a Finite Group and Solvabilizers},
author = {Doron Hai-Reuven},
journal= {arXiv preprint arXiv:1307.2924},
year = {2013}
}