This thesis is about graphs associated with finite groups. After a review of some of them, we find the best bound for the diameter of the non-nilpotent graph. In the main part of the work, we build a general framework which generalizes many of the graphs described previously: we introduce the non-$\mathfrak F$ graph of a finite group and we prove some results about it.

Graphs encoding properties of finite groups

Nemmi, Daniele
2020/2021

Abstract

This thesis is about graphs associated with finite groups. After a review of some of them, we find the best bound for the diameter of the non-nilpotent graph. In the main part of the work, we build a general framework which generalizes many of the graphs described previously: we introduce the non-$\mathfrak F$ graph of a finite group and we prove some results about it.
2020-09-25
37
finite groups, graphs, generating graph, non-nilpotent graph, formations
File in questo prodotto:
File Dimensione Formato  
tesi_Nemmi.pdf

accesso aperto

Dimensione 602.28 kB
Formato Adobe PDF
602.28 kB Adobe PDF Visualizza/Apri

The text of this website © Università degli studi di Padova. Full Text are published under a non-exclusive license. Metadata are under a CC0 License

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/20.500.12608/21914