Non-cyclic graphs of (non)orientable genus one

Abstract

Let G be a finite non-cyclic group. The non-cyclic graph G of G is the graph whose vertex set is G Cyc(G), two distinct vertices being adjacent if they do not generate a cyclic subgroup, where Cyc(G)=\a∈ G: a,b\ is cyclic for each b∈ G\. In this paper, we classify all finite non-cyclic groups G such that G has (non)orientable genus one.

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…