Tag Archives: graph theory

Graph isomorphism

A graph is a collection of dots (called vertices) joined by curve segments (called edges). It doesn’t matter how you name the vertices and it doesn’t matter where you put them in your drawing. Two graphs are called isomorphic if you can rearrange the way one of them is drawn to make it look like the other. So for example you might convince yourself that a pentagon and pentagram are isomorphic to each other.

Untitled Continue reading Graph isomorphism