 Trivial diameter bound for a finite group

A connected Cayley graph on a finite group $G$ has $|G|$ vertices, and a shortest path repeats no vertex. Therefore