论文标题
识别有限组的通勤图
Recognizing the Commuting Graph of a Finite Group
论文作者
论文摘要
在本文中，我们研究了有限组的通勤图的可实现性问题：鉴于一个无方向的图形$ x $，它是$ g $的通勤图吗？如果是这样，请确定这样的组。我们为此问题寻求有效的算法。我们对此问题进行了一些一般性观察，并为外部组的情况获得多项式时间算法。
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.
