Abstract
Let be a finite non-cyclic group. The non-cyclic graph of is the graph whose vertex set is , two distinct vertices being adjacent if they do not generate a cyclic subgroup, where . In this paper, we classify all finite non-cyclic groups such that has (non)orientable genus one.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.