FindGraphIsomorphism

FindGraphIsomorphism(graph1, graph2)

returns an isomorphism between graph1 and graph2 if it exists. Return an empty list if no isomorphism exists.

See:

• Wikipedia - Graph isomorphism

Examples

>> FindGraphIsomorphism(Graph({1,2,3,4},{1<->2,1<->4,2<->3,3<->4}), Graph({1,2,3,4},{1<->3,1<->4,2<->3,2<->4}))
{<|1->2,2->3,3->1,4->4|>}

Related terms

IsomorphicGraphQ, GraphCenter, GraphDiameter, GraphPeriphery, GraphRadius, AdjacencyMatrix, EdgeList, EdgeQ, EulerianGraphQ, FindEulerianCycle, FindHamiltonianCycle, FindVertexCover, FindShortestPath, FindSpanningTree, Graph, GraphQ, HamiltonianGraphQ, VertexEccentricity, VertexList, VertexQ

Implementation status

• ✅ - full supported

Github

• Implementation of FindGraphIsomorphism