Аннотация:
The problem of the realizability of a graph as the prime graph (the Gruenberg–Kegel graph) of a finite group is considered. This problem is completely solved for graphs with at most five vertices.
Ключевые слова:finite group, prime graph (Gruenberg–Kegel graph), realizability of a graph.