Frucht's theorem (English, name)
expansion: Frucht's theorem
Senses:
topics: graph-theory
mathematics
sciences
glosses: The statement that every finite group is the group of symmetries of a finite undirected graph. More strongly, for any finite group G there exist infinitely many non-isomorphic simple connected graphs such that the automorphism group of each of them is isomorphic to G.
Forms: