Semiregularity and connectivity of the non- F graph of a finite group

Abstract

Given a class F of finite groups, we consider the graph F(G) whose vertices are the elements of G and where two vertices g,h∈ G are adjacent if and only if g,h F. Moreover we denote by I F(G) the set of the isolated vertices of F(G). We address the following question: to what extent the fact that I F(G) is a subgroup of H for any H≤ G, implies that the graph FG) obtained from F(G) by deleting the isolated vertices is a connected graph?

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…