Neighborhoods, connectivity, and diameter of the nilpotent graph of a finite group
Costantino Delizia, Michele Gaeta, Mark L. Lewis, and Carmine Monetta

TL;DR
This paper explores the properties of the nilpotent graph of finite groups, focusing on topological features, connectivity, and diameter bounds, especially for solvable groups and specific group classes.
Contribution
It characterizes finite solvable groups with nilpotent neighborhoods and provides bounds on the diameter of related graphs after removing universal vertices.
Findings
Characterization of finite solvable groups with nilpotent neighborhoods
Connectivity analysis of the reduced nilpotent graph
Upper bounds on the diameter of the graph for certain group classes
Abstract
The nilpotent graph of a group is the simple and undirected graph whose vertices are the elements of and two distinct vertices are adjacent if they generate a nilpotent subgroup of . Here we discuss some topological properties of the nilpotent graph of a finite group . Indeed, we characterize finite solvable groups whose closed neighborhoods are nilpotent subgroups. Moreover, we study the connectivity of the graph obtained removing all universal vertices from the nilpotent graph of . Some upper bounds to the diameter of are provided when belongs to some classes of groups.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGraph theory and applications · Advanced Graph Theory Research · Finite Group Theory Research
