简单无向图的不同构个数计算,主要定理为Burnside引理。Calculation of simple undirected non-isomorphic graphs based on Burnside's lemma.
-
Updated
May 24, 2022 - Python
简单无向图的不同构个数计算,主要定理为Burnside引理。Calculation of simple undirected non-isomorphic graphs based on Burnside's lemma.
Finding out if two given graphs are isomorphic
Add a description, image, and links to the isomorphic-graphs topic page so that developers can more easily learn about it.
To associate your repository with the isomorphic-graphs topic, visit your repo's landing page and select "manage topics."