FindGraphIsomorphism

Tersedia

Finds vertex mapping between isomorphic graphs

Bentuk

FindGraphIsomorphism[g1, g2]

FindGraphIsomorphism[g1, g2, n]

FindGraphIsomorphism[{v -> w, …}, …]

Contoh disahkanFindGraphIsomorphism[CycleGraph[3], CycleGraph[4]] → {}map = (Normal /@ FindGraphIsomorphism[g, h])[[1]] → g

Jalankan ini di Qurak Cari dalam rujukan

Topik

Discrete Mathematics - Graphs and Networks »
Graph Predicates - Global Structural Properties
Graph Properties And Measurements - Graph Isomorphism
New In100 Graphs And Networks - Isomorphisms
New In80 Alphabetical Listing - F

Berkaitan

IsomorphicGraphQ CanonicalGraph GraphAutomorphismGroup FindIsomorphicSubgraph FindSubgraphIsomorphism IsomorphicSubgraphQ VertexReplace FindShortestPath AcyclicGraphQ BipartiteGraphQ ConnectedGraphQ EulerianGraphQ

Semua 6300 fungsi · Gunakan ini daripada klien MCP