SearcharxivSearch

arXiv · 2502.03308

Neighborhoods, connectivity, and diameter of the nilpotent graph of a finite group

Abstract

The nilpotent graph of a group $G$ is the simple and undirected graph whose vertices are the elements of $G$ and two distinct vertices are adjacent if they generate a nilpotent subgroup of $G$. Here we discuss some topological properties of the nilpotent graph of a finite group $G$. Indeed, we characterize finite solvable groups whose closed neighborhoods are nilpotent subgroups. Moreover, we study the connectivity of the graph $\Gamma(G)$ obtained removing all universal vertices from the nilpotent graph of $G$. Some upper bounds to the diameter of $\Gamma(G)$ are provided when $G$ belongs to some classes of groups.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Costantino Delizia, Michele Gaeta, Mark L. Lewis, Carmine Monetta. 2025-02-05. Neighborhoods, connectivity, and diameter of the nilpotent graph of a finite group. https://arxiv.org/abs/2502.03308

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR