Let Gamma G denote a graph associated with a group G. A compelling question about finite groups asks whether or not a finite group H must be nilpotent provided Gamma H is isomorphic to Gamma G for a finite nilpotent group G. In the present work we analyze the problem for different graphs that one can associate with a finite group, both reporting on existing answers and contributing to new ones.
GROUP NILPOTENCY FROM A GRAPH POINT OF VIEW
Grazian V.;Monetta C.
2024-01-01
Abstract
Let Gamma G denote a graph associated with a group G. A compelling question about finite groups asks whether or not a finite group H must be nilpotent provided Gamma H is isomorphic to Gamma G for a finite nilpotent group G. In the present work we analyze the problem for different graphs that one can associate with a finite group, both reporting on existing answers and contributing to new ones.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
