**Problem 1A: Find all the automorphisms of Petersen Graph.**

**Solution:** We can label the vertices of the graph by 2-subsets in , such that any two vertices are adjacent iff the intersection of their labels is empty. Then any permutation of will induce an automorphism of the graph since the adjacency is preserved. Hence there are such automorphisms. The interesting part is how to show that they are actually all the automorphisms of Petersen Graph. In my opinion, the question to determining all the automorphisms for a particular object is not easy in general. However, for Petersen Graph, it is possible, and there are three steps to show this. Suppose the vertices of the graph are First, show that given any two vertices , there exists an automorphism mapping to . Denote by the set of all the automorphisms that map to Show that for any so that So the number of all the automorphisms are Second, show that given any permutation of the three neighbors of there exists an automorphism in permuting the neighbors in that way. There are such permutations Denote the corresponding automorphisms by Consider the subgroup of automorphisms that fix and its three neighbors, denoted by It is not hard to show that Show that Hence and therefore the number of all the automorphisms is

**Notes:** Let and is an integer such that Consider the following graph. Let the vertices be all the -subsets of and two vertices are adjacent iff they are disjoint. It is called an **Kneser Graph** It is obvious that any permutation of leads to an automorphism of the graph. Are these automorphisms form the whole automorphism group of the Kneser graph? Yes, it is. Many thanks to Tan Ming Ming who found the following paper answering my question! (Ming ming is a phd student supervised under Professor Bernhard Schmidt. ) See **http://www.math.uky.edu/~braun/Braun_AutomorphismGroupStableKneserGraph.pdf **