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 s(G) of G is a graph with vertex set G Sol(G) and two distinct vertices u and v are adjacent if and only if u, v is solvable. We show that s (G) is not a star graph, a tree, an n-partite graph for any positive integer n ≥ 2 and not a regular graph for any non-solvable finite group G. We compute the girth of s (G) and derive a lower bound of the clique number of 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 s (G) and the solvability degree of 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.

Discussion (0)

Sign in to join the discussion.

Loading comments…