Nonexistence of Efficient Dominating Sets in the Cayley Graphs Generated by Transposition Trees of Diameter 3

Italo J. Dejter, Oscar Tomaiconza

Let $d,n$ be positive integers such that $d<n$, and let $X_n^d$ be a Cayley graph generated by a transposition tree of diameter $d$. It is known that every $X_n^d$ with $d<3$ split…