Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 5 Feb 2025 in math.GR | (2502.03308v2)

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

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.