1. The problem statement, all variables and given/known data I'm given a graph and am told to find non-trivial self isomorphisms. Non-trivial meaning that at least 1 node is "not mapped onto itself." I've tried looking for self isomorphism but I can't find anything. I can tell when two graphs are isomorphic through inspection but "self-isomorphism" doesn't make any sense to me. Does this mean I'm suppose to split the graph and find a two that are isomorphic? So cut a whole bunch of edges and see if I can make two isomorphic graphs?? I'm just looking for clarity. Thanks.