Unformatted text preview: {h G i G contains a triangle } . 3. Call graphs G and H isomorphic if the nodes of G may be reordered so that it is identical to H . Show that ISO ∈ NP , where ISO = {h G,H i G and H are isomorphic graphs } . 1...
View
Full Document
 Spring '11
 Staff
 Graph Theory, Binary relation, RIAN GLE

Click to edit the document details