Non-solvable graphs of groups

DOI10.1007/S40840-021-01228-2MaRDI QIDQ6326036arXivFDO

Authors Parthajit Bhowal, Deiborlang Nongsiang, Rajat Kanti Nath

Publication date 26 September 2019

Published in arXiv

Full work available at URL https://doi.org/10.1007/S40840-021-01228-2

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Arithmetic and combinatorial problems involving abstract finite groups (20D60)

arXiv classification

math.GR

Abstract: Let $G$ be a group and $Sol(G)=xinG:langlex,yangleextissolvableforallyinG$. We associate a graph $mathcal{NS}_G$ (called the non-solvable graph of $G$) with $G$ whose vertex set is $GsetminusSol(G)$ and two distinct vertices are adjacent if they generate a non-solvable subgroup. In this paper we study many properties of $mathcal{NS}_G$. In particular, we obtain results on vertex degree, cardinality of vertex degree set, graph realization, domination number, vertex connectivity, independence number and clique number of $mathcal{NS}_G$. We also consider two groups $G$ and $H$ having isomorphic non-solvable graphs and derive some properties of $G$ and $H$. Finally, we conclude this paper by showing that $mathcal{NS}_G$ is neither planar, toroidal, double-toroidal, triple-toroidal nor projective.

This page was built for publication: Non-solvable graphs of groups

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