A note on solvable graphs of finite groups

Abstract

Let $G$ be a finite non-solvable group with solvable radical $Sol(G)$. The solvable graph ${\Gamma }_s(G)$ of $G$ is a graph with vertex set $G\setminus Sol(G)$ and two distinct vertices $u$ and $v$ are adjacent if and only if $⟨u,v⟩$ is solvable. We show that ${\Gamma }_s(G)$ is not a star graph, a tree, an $n$-partite graph for any positive integer $n\ge 2$ and not a regular graph for any non-solvable finite group $G$. We compute the girth of ${\Gamma }_s(G)$ and derive a lower bound of the clique number of ${\Gamma }_s(G)$. We prove the non-existence of finite non-solvable groups whose solvable graphs are planar, toroidal, double-toroidal, triple-toroidal or projective. We conclude the paper by obtaining a relation between ${\Gamma }_s(G)$ and the solvability degree of $G$.

10 pages

Cited by in corpus (1)

• The Solubility Graph Associated With a Finite Group