Recognizing the Commuting Graph of a Finite Group
share
In this paper we study the realizability question for commuting graphs of finite groups: Given an undirected graph X is it the commuting graph of a group G? 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.
READ FULL TEXT
