Asymmetric graphs I am working from the book, "Invitation to Discrete Math." On page 117 there's a question that asks to construct an Asymmetric graph. I thought I did with a graph of 5 vertices. However, immediately after the question, there's another one which asks to prove that no asymmetric graph of less than or equal to 5 vertices exist. (Image to be attached). Could you show me why the graph I constructed is not asymmetric? ![Image of the graph]( have highlighted the vertices by circling in green. Thank you!

Let me name the vertices. The top left is A, the top right is B, the middle is C, the bottom left is D and the bottom right is E.

Then you can use this permutation: $\\{A,B,C,D,E\\}\to\\{E,B,D,C,A\\}$