Note: This page has been translated by MathWorks. Click here to see

To view all translated materials including this page, select Country from the country navigator on the bottom of this page.

To view all translated materials including this page, select Country from the country navigator on the bottom of this page.

Compute isomorphism between two graphs

`P = isomorphism(G1,G2)`

`P = isomorphism(___,Name,Value)`

`[P,edgeperm] = isomorphism(___)`

computes a graph isomorphism
equivalence relation between graphs `P`

= isomorphism(`G1,G2`

)`G1`

and `G2`

,
if one exists. If no isomorphism exists, then `P`

is an empty
array.

specifies additional options with one or more name-value pair arguments. For
example, you can specify `P`

= isomorphism(___,`Name,Value`

)`'NodeVariables'`

and a list of node
variables to indicate that the isomorphism must preserve these variables to be
valid.