ABSTRACT
A representation of a graph is a mapping of its vertices into a real vector space, constructed from an eigenspace of its adjacency matrix. For a distance-regular graph G this mapping has the property that the distance between the images of two vertices is determined by their distance in G. In this chapter we develop the basic theory of representations of distance-regular graphs, and present a number of its applications.
