Minimal Cayley graphs on 384 vertices
收藏Zenodo2025-06-30 更新2026-05-26 收录
下载链接：
https://zenodo.org/doi/10.5281/zenodo.15721425
下载链接
链接失效反馈官方服务：
资源简介：
A Cayley graph Cay(G,S) is minimal if S defines an inclusion-minimal generating set of G.
A complete list of all minimal Cayley graphs on up to 511 vertices has been determined (33645009 graphs in total). Group theoretical computations were performed using GAP, while reduction modulo graph isomorphism was done using Nauty. We plan to publish details of the enumerative methods and computational techniques used in the near future. This work extends the collection of Kolja Knauer found at the House of graphs, and is also available at graphsym.net.
The resulting graphs are available in sparse6 format. The file below contains all Cayley graphs of order 384 (24327615 graphs).
The minimal Cayley graphs of order 2 to 511 except for order 384 are stored separately.
提供机构：
Zenodo创建时间：
2025-06-30
