FindGraphIsomorphism

FindGraphIsomorphism[g1,g2]

finds an isomorphism that maps the graph g1 to g2 by renaming vertices.

FindGraphIsomorphism[g1,g2,n]

finds at most n isomorphisms.

FindGraphIsomorphism[{vw,},]

uses rules vw to specify the graph g.

Details and Options

Examples

open allclose all

Basic Examples  (2)

Find an isomorphism that maps two graphs:

Find all isomorphisms:

Scope  (8)

Specification  (5)

FindGraphIsomorphism works with undirected graphs:

Directed graphs:

Use rules to specify the graph:

It returns an empty list if no isomorphism can be found:

FindGraphIsomorphism works with large graphs:

Enumeration  (3)

Find an isomorphism that maps two graphs:

Find at most two isomorphisms:

Find all isomorphisms:

Applications  (1)

Find an isomorphism that maps two graphs:

Highlight and label two graphs according to the mapping:

Properties & Relations  (3)

Isomorphic graphs have the same number of vertices and edges:

Test whether two graphs are isomorphic using IsomorphicGraphQ:

Isomorphic graphs have the same canonical graph:

Introduced in 2010
 (8.0)
 |
Updated in 2014
 (10.0)
2015
 (10.3)