IsomorphicGraphQ

IsomorphicGraphQ(graph1, graph2)

returns True if an isomorphism exists between graph1 and graph2. Return Falsein all other cases.

See:

• Wikipedia - Graph isomorphism

Examples

>> IsomorphicGraphQ(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}))
True

Related terms

FindGraphIsomorphism, 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 IsomorphicGraphQ