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 (G) obtained removing all universal vertices from the nilpotent graph of G. Some upper bounds to the diameter of (G) are provided when G belongs to some classes of groups.

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…