Recognizing the Commuting Graph of a Finite Group
Group Theory
2022-06-03 v1 Computational Complexity
Abstract
In this paper we study the realizability question for commuting graphs of finite groups: Given an undirected graph is it the commuting graph of a group ? And if so, to determine such a group. We seek efficient algorithms for this problem. We make some general observations on this problem, and obtain a polynomial-time algorithm for the case of extraspecial groups.
Cite
@article{arxiv.2206.01059,
title = {Recognizing the Commuting Graph of a Finite Group},
author = {V. Arvind and Peter. J. Cameron},
journal= {arXiv preprint arXiv:2206.01059},
year = {2022}
}