Two theorems are proved in this paper. Theorem 1 describes the connect
ed mu-regular graphs without 3-claws. Necessary and sufficient conditi
ons for a connected amply regular graph with mu > 1 to be separated ar
e obtained in Theorem 2. A graph Gamma is said to be separated if for
any vertex a in Gamma the subgraph Gamma(2)(a) contains vertices b and
c at a distance 2 in Gamma(2)(a), and the mu-subgraph for any such pa
ir does not intersect the neighbourhood of a.