遇见数据集

Ramanujan graphs with degree 3, 4, 5, 6, or 7

收藏
NIAID Data Ecosystem2026-03-13 收录
数据链接:
官方服务:

资源简介:

This data set collects all Ramanujan graphs 3-regular with at most 20 vertices 4-regular with at most 16 vertices 5-, 6-, 7-regular with at most 14 vertices Bipartite Ramanujan graphs 4-regular with at most 22 vertices 5-, 6-, 7-regular with at most 20 vertices Vertex-transitive Ramanujan graphs 4-, 5-, 6-, 7-regular with at most 47 vertices All files are in Graph6 data format. If a file for a given order does not exist, there are no graphs with that order and the respective property.

创建时间:
2022-06-02
二维码
社区交流群
二维码
科研交流群
商业服务