Qurak
文档
价格
登录
Qurak
文档
函数
FindGraphIsomorphism
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
← FindGraphCommunities
FindGraphPartition →
全部 6300 个函数
·
从 MCP 客户端使用