Finite groups with star-free noncyclic graphs
Abstract
For a finite noncyclic group G, let (G) be a set of elements a of G such that a,b is cyclic for each b of G. The noncyclic graph of G is a graph with the vertex set G (G), having an edge between two distinct vertices x and y if x, y is not cyclic. In this paper, we classify all finite noncyclic groups whose noncyclic graphs are K1,n-free, where 3≤ n≤ 6.
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.