pith. sign in

arxiv: 1512.00935 · v1 · pith:36XWQGLWnew · submitted 2015-12-03 · 🧮 math.GR

Non-cyclic graphs of (non)orientable genus one

classification 🧮 math.GR
keywords non-cycliccyclicfinitegammagenusgraphorientableadjacent
0
0 comments X
read the original abstract

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

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.