Terwilliger Graphs with $\mu\le3$

A Terwilliger graph is a noncomplete graph in which intersection of the neighborhoods of any two vertices at distance 2 from each other is a $\mu$-clique. We classify connected Terwilliger graphs with $\mu=3$ and describe the structure of Terwilliger graphs of diameter 2 with $\mu=2$.