+160 How do I prove that two graphs are isomorphic?
Is it just that there has to be the same number of nodes, and they have to match up/connect to the same corresponding nodes?
V1 is connected to V2 and V3, U1 is connected to U2 and U3?
Any help is appreciated :)
