Solvable graphs of finite groups

From MaRDI portal
Publication:5164259



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






Describes a project that uses

Uses Software






This page was built for publication: Solvable graphs of finite groups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5164259)