Geometric distance-regular graphs without 4-claws

A non-complete distance-regular graph Γ is called geometric if there exists a set C of Delsarte cliques such that each edge of Γ lies in a unique clique in C. In this paper we determine the non-complete distance-regular graphs satisfying 3,83(a1+1)