Non-nilpotent graph of a group.

From MaRDI portal
Publication:3079286




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.




Cited in
(32)


Describes a project that uses

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)