This post is concerning automorphisms of graphs, which quantify the symmetry existing within the graph structure. Given two graphs and , a bijection which maintains adjacency, i.e. , is called an isomorphism and the graphs and are called isomorphic. Clearly isomorphic graphs are essentially the same, with the superficial difference between them on account of different notation used in defining the vertex set. A isomorphism from the graph to itself is called an automorphism. It is easy to see that the set of all automorphisms on a graph together with the operation of composition of functions forms a group. This group is called the automorphism group of the graph, and is denoted by .
In the remainder of this post we investigate some well known graphs and find out their automorphism groups.
The first graph we take up is the complete graph . Any permutation of its vertices is in fact an automorphism for adjacency is never lost. Its automorphism group is therefore .
The next graph is the complete bipartite graph . First consider the case . The vertices in the first partite set can be permuted in ways and similarly ways for the second partite set. Corresponding to each of these limited permutations we get automorphisms because adjacency is never disturbed. On the other hand, no automorphism can result from swapping a vertex from the first partite set and the second partite set because unless such a swap is done in its entirety (i.e. all the vertices from the first partite set swap places with the vertices in the second partite set), adjacency will be lost. A swap can be done in entirety only if which is not the case we are considering. Hence no further automorphisms can result. Moreover by the multiplication rule it is simple to observe that the automorphism group would be isomorphic to .
In the case of , we first pair off the vertices in the two partite sets against each other. This is also an automorphism, say . Now for each of the ways of permuting vertices within partite sets, an additional automorphism arises. It is obtained in this fashion: After permuting the vertices within the partite sets by the particular way we swap each vertex with its pair in the other partite set. Clearly this yields automorphisms and furthermore no more are possible. Since every element of can be written as a unique product of an automorphism collection of the type covered in counting the first ways (which is not hard to see is a normal subgroup, being of index 2) and of the subgroup so we see that the automorphism group is .
The next graph we take up is the cycle graph . Firstly note that any automorphism can be obtained in this way: A given vertex may be mapped to any of the vertices available (including itself). As soon as that is done, an adjacent vertex to has only two choices left: it can either be in the counter clockwise direction to or in the clockwise direction to . Once that choice is also made, no other choices are required. Hence we get automorphisms this way and there can be no others. Also, it is clear that two kinds of automorphisms suffice to generate this group: rotation, and swapping the notion of clockwise and counter clockwise (assuming we draw the cycle graph as equally spaced points on the unit circle; there is no loss of generality in doing that). But both these automorphisms also generate the dihedral group which also has elements. It follows that .
The final graph we take up is the well known Petersen graph. Instead of directly considering what possible functions are there in its automorphism group (although such an approach is possible) we approach the problem through the concept of line graphs.
Definition: A line graph of a graph is the graph whose vertices are in one to one correspondence with the edges of , two vertices of being adjacent if and only if the corresponding edges of are adjacent.
Lemma 1: is the complement of the Petersen graph.
Proof: It is clear that if the vertices of are labelled then its 10 edges are the 2-subsets of . The line graph thus has 10 vertices, labeled by these 10 2-subsets . Two vertices are adjacent in iff the two 2-subsets have a nontrivial overlap. The complement of is the graph with the same 10 vertices, and with two vertices being adjacent iff the corresponding two 2-subsets are disjoint. But this is the very definition of the Petersen graph.
Lemma 2: is equal to .
Proof: If then for any two vertices we have , i.e. , i.e. so that . The reverse implication follows by replacing by .
Theorem 3: The automorphism group of the Petersen graph is .
Proof: In view of Lemma 1 and 2 it suffices to find out for the automorphism group of the Petersen graph is going to be the same. We let have the vertex set in the sequel.
Take any automorphism of . If we have two edges with , then either of two cases arise. Either or not. If then obviously and so by injectivity of we have . If then it must be that . This means that and again by injectivity we have . What this means is that the function induced by on in the natural way is injective. It is also surjective as for any clearly . Finally, this function is an automorphism since clearly implies and is implied by as there is a common vertex. As our definition of the induced function is obtained in a definite way we have shown that every automorphism of induces a unique automorphism of . Moreover, it is easy to see that if are two automorphisms then the automorphism induced by is the same as the automorphism induced by composed by .
We now show that given an automorphism of we can obtain an automorphism of which induces it in the natural way. Let . It is easy to see that the 4-cliques of originate from the stars of . So has exactly 4-cliques, say where contains 4 vertices corresponding to the 4 edges in that are incident to a vertex in . Since is an automorphism it sends 4-cliques to 4-cliques. Also, must send two different 4-cliques with to different 4-cliques, because if it sends them to the same 4-clique then a collection of at least 5 vertices is mapped to a collection of vertices, a contradiction to the injectivity of . So induces a permutation of the ‘s.
Now suppose and are two different automorphisms in . Then they differ on at least vertex in , say on the vertex . Now given any vertex in consider the intersection of the 4-cliques and . If is some vertex in then as an edge in is part of stars with centers and , i.e. . Hence the intersection contains only the vertex . Every vertex of arises in this way. So if , then either or for otherwise .
Hence every automorphism of induces a unique permutation of the ‘s. Moreover distinct automorphisms induce distinct permutations so that the automorphisms and the permutations can be put in one-one correspondence. Consider an automorphism of the vertices of where if in the permutation corresponding to . Now a vertex of . This is also the intersection of the 4-cliques and and so . This shows that induces as an automorphism.
Hence we have shown that . So the Petersen graph has the automorphism group .