Definitions from Wiktionary (Frucht's theorem)

▸ noun:  (graph theory) 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.


▸ Words similar to frucht's theorem
▸ Usage examples for frucht's theorem

▸ Idioms related to frucht's theorem
▸ Wikipedia articles (New!)
▸ Words that often appear near frucht's theorem
▸ Rhymes of frucht's theorem

▸ Invented words related to frucht's theorem