  We show that the higher rank lamplighter groups, or Diestel-Leader groups
$\Gamma_d(q)$ for $d \geq 3$, are graph automatic. This introduces a new family
of graph automatic groups which are not automatic.
