Distance transitive graphs

In this BSc thesis we focus on the family of very symmetric graphs, known as distance transitive graphs. These are the graphs such that, given any two vertices u and v at any distance and any other two vertices x and y at the same distance, there is an automorphism of the graph that carries u to x and v to y. Distance transitive graphs are thus in some sense graphs with maximal degree of symmetry. In the BSc thesis the concept of distance transitive graphs is presented and some basic results about these graphs are proved. Some infinite families of such graphs are presented. The main part of the thesis is the classfication of cubic distance tranistive graphs. We show that there exist exactly 12 such graphs