5208
More strongly , for any finite group G there exist infinitely many non-isomorphic simple connected graph s such that the automorphism group of each of them is isomorphic to G. Proof idea The main idea of the proof is to observe that the Cayley graph of G , with the addition of colors and orientations on its edges to distinguish the generators of G from each other , has the desired automorphism group .
 None
Please list all entity words in the text that fit the category. Output format is "word1, word2". 
Option: location, person, organization 
Text: {0} 
Answer:
 None