with the property that any two vertices and from are adjacent if and only if and are adjacent in .
If an isomorphism can be constructed between two graphs, then we say those graphs are isomorphic.
For example, consider these two graphs:
Although these graphs look very different at first, they are in fact isomorphic; one isomorphism between them is
|Date of creation||2013-03-22 12:16:24|
|Last modified on||2013-03-22 12:16:24|
|Last modified by||vampyr (22)|