Martin invariants
收藏官方服务：
资源简介：
These text files contain Martin invariants for complete lists of cyclically 4-connected 3-regular graphs (Martin3.txt) and cyclically 6-connected 4-regular graphs (Martin4.txt). For each regular graph G, the Martin invariant is the integer that counts the number of partitions of the edges of G into spanning trees. For details, see the paper "Feynman symmetries of the Martin and c_2 invariants of regular graphs" by Erik Panzer and Karen Yeats in Combinatorial Theory.
提供机构：
University of Oxford创建时间：
2024-10-22
