On distance-regular graphs with Be=1

This thesis is an exposition of the paper of Hiroshi Suzuki entitled On Distance-Regular Graphs with be = 1 . Let a graph (T) be a DRG with valency k, diameter d and height h and let e be the smallest integer such that be = 1. The following is shown:(1) Assume d = 2e and K 2 and suppose kd is not equal to 1. Then e is greater than of equal to 5.(2) Suppose d is greater than or equal to 2e + 1, k is greater than 2, and kd is not equal to 1. Then the following hold:(a) b1 = cd-1 for i = 1,2,3,...,d-2e(b) a1 = ad-1 = ad = 0(c) h is greater than or equal to 2d - 4e + 3(d) d is less than or equal to max & 2e, (5/2)e -