Source: wikibot/frucht-s-theorem
= Frucht's theorem
{wiki=Frucht's_theorem}
Frucht's theorem is a result in graph theory that states that for any finite group \\( G \\), there exists a finite undirected graph (called a "Frucht graph") that is a Cayley graph of \\( G \\) and is also vertex-transitive (meaning that for any two vertices in the graph, there is some automorphism of the graph that maps one vertex to the other).