Math Is Fun Forum

GemmaJ1988

Member

Registered: 2008-10-08

Posts: 39

Isomorphic graphs

I have a revision question which asks me to prove two graphs are isomorphic.

from the definition i know that 2 graphs G and H are isomorphic if there exists a bijection

such that if there are k edges between x,y in V(G) then we have k edges between w(x),w(y) in v(H)

Does anyone know what steps i would take to prove they are isomorphic?
please help