FindGraphIsomorphism

利用可能

Finds vertex mapping between isomorphic graphs

形式

FindGraphIsomorphism[g1, g2]

FindGraphIsomorphism[g1, g2, n]

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

検証済みの例FindGraphIsomorphism[CycleGraph[3], CycleGraph[4]] → {}map = (Normal /@ FindGraphIsomorphism[g, h])[[1]] → g

Qurakで実行リファレンスを検索

トピック

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

関連

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

全 6300 関数 · MCPクライアントから使う