Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Neighborhoods, connectivity, and diameter of the nilpotent graph of a finite group (2502.03308v2)

Published 5 Feb 2025 in math.GR

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.

Summary

We haven't generated a summary for this paper yet.