Show that the inverse of an isomorphism of graphs is also an isomorphism of graphs.
So, I just started a graph theory course and am having a little trouble with one of the problems on the homework. I know that a graph is isomorphic if there are bijections $Θ:V(G)→V(H)$ and $Φ:E(G)→E(H)$ such that $Ϯ_G(e)=uv$ if and only if $Ϯ_H(Φ(e))=Θ(u)Θ(v)$. That is, they have the same structure, but differ only in the names of the vertices and edges. I just don't know how to find the inverse of an isomorphic graph.