Prime graph
Undirected graph defined from a group / From Wikipedia, the free encyclopedia
This article is about graphs defined from finite groups. For the graphs that cannot be decomposed as a product of smaller graphs, see Cartesian product of graphs.
In the mathematics of graph theory and finite groups, a prime graph is an undirected graph defined from a group. These graphs were introduced in a 1981 paper by J. S. Williams, credited to unpublished work from 1975 by K. W. Gruenberg and O. Kegel.[1]