Group nilpotency from a graph point of view
This paper gives a quite comprehensive survey of the literature regarding the graphs \(\Gamma_{G}\) which can be associated with a group \(G\). In particular, they focus on the problem of understanding whether or not a finite group \(H\) must be nilpotent provided \(\Gamma_{H}\) is isomorphic to \(\Gamma_{G}\) for a finite nilpotent group \(G\).\N\NThe authors bring a new contribution to the issue mentioned above by proving Theorem 5.1: Let \(G\) and \(H\) be finite \(2\)-generated groups with isomorphic generating graphs. If \(G\) is nilpotent and \(H\) is supersoluble, then \(H\) is nilpotent.
- Connectivity of generating graphs of nilpotent groups
- On the genus of the nilpotent graphs of finite groups.
- Finite groups with isomorphic non-commuting graphs have the same nilpotency property
- A conjecture related to the nilpotency of groups with isomorphic non-commuting graphs
- FINITE GROUPS WITH THE SAME JOIN GRAPH AS A FINITE NILPOTENT GROUP
This page was built for publication: Group nilpotency from a graph point of view
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6618056)
