  Let $d,n$ be positive integers such that $d<n$, and let $X^d_n$ be a Cayley
graph generated by a transposition tree of diameter $d$. It is known that every
$X^d_n$ with $d<3$ splits into efficient dominating sets. The main result of
this paper is that $X^3_n$ does not have efficient dominating sets.
