Distance-regular graphs without 4-claws

Sejeong Bang, Alexander Gavrilyuk, Jack Koolen

We determine the distance-regular graphs with diameter at least $3$ and $c_2\ge 2$ but without induced $K_{1,4}$-subgraphs.