On the genus of the commuting graphs of finite non-abelian groups
classification
🧮 math.GR
keywords
commutingfinitenon-abeliangraphsgroupsgenusgraphgroup
read the original abstract
The commuting graph of a non-abelian group is a simple graph in which the vertices are the non-central elements of the group, and two distinct vertices are adjacent if and only if they commute. In this paper, we classify (up to isomorphism) all finite non-abelian groups whose commuting graphs are acyclic, planar or toroidal. We also derive explicit formulas for the genus of the commuting graphs of some well-known class of finite non-abelian groups, and show that, every collection of finite non-abelian groups whose commuting graphs have the same genus is finite.
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.