Non-Nilpotent Graph of a Group

From MaRDI portal
Publication:3079286

DOI10.1080/00927870903386460zbMATH Open1216.20018arXiv0910.0098OpenAlexW2027341098MaRDI QIDQ3079286FDOQ3079286

Alireza Abdollahi, Mohammad Zarrin

Publication date: 2 March 2011

Published in: Communications in Algebra (Search for Journal in Brave)

Abstract: We associate a graph mathcalNG with a group G (called the non-nilpotent graph of G) as follows: take G as the vertex set and two vertices are adjacent if they generate a non-nilpotent subgroup. In this paper we study the graph theoretical properties of mathcalNG and its induced subgraph on , where nil(G)=xinG|<x,y>extisnilpotentforallyinG. For any finite group G, we prove that mathcalNG has either |Z*(G)| or |Z*(G)|+1 connected components, where Z*(G) is the hypercenter of G. We give a new characterization for finite nilpotent groups in terms of the non-nilpotent graph. In fact we prove that a finite group G is nilpotent if and only if the set of vertex degrees of mathcalNG has at most two elements.


Full work available at URL: https://arxiv.org/abs/0910.0098





Cites Work


Cited In (26)

Uses Software






This page was built for publication: Non-Nilpotent Graph of a Group

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