Stack Exchange network consists of 183 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
A simple, undirected graph $G = (V,E)$ is said to be strongly rigid if the identity is the only graph homormorphismendomorphism.
For which positive integers $k>2$ is there a strongly rigid $k$-regular graph?
A simple, undirected graph $G = (V,E)$ is said to be strongly rigid if the identity is the only graph homormorphism.
A simple, undirected graph $G = (V,E)$ is said to be strongly rigid if the identity is the only graph endomorphism.
