A simple, undirected graph $G = (V,E)$ is said to be *strongly rigid* if the identity is the only [graph homormorphism](https://en.wikipedia.org/wiki/Graph_homomorphism).

For which positive integers $k>2$ is there a strongly rigid $k$-[regular](https://en.wikipedia.org/wiki/Graph_homomorphism) graph?