Perfect commuting graphs (Q528911)

Let \(G\) be a finite group. The commuting graph of \(G\) is the graph \(\Gamma(G)\) with vertices being the elements of \(G - Z(G)\), and two vertices are adjacent if and only if they commute. This graph has been studied quite a bit recently, and the authors add to this by classifying all finite quasisimple groups whose commuting graph is perfect. (Recall that a graph is called perfect if the chromatic number and clique number coincide for every induced subgraph.) The second main result of the paper studies arbitrary finite groups with perfect commuting graphs. For example, such groups have at most two components, and if there are exactly two components, the possible structures of these are listed.