遇见数据集

Large graphs of given maximum degree and diameter (Degree-Diameter Problem): 8 constructions, 3 November 2026

收藏
Zenodo2026-11-04 更新2026-11-05 收录
官方服务:

资源简介:

Eight graphs for the degree-diameter problem: (8,10) 27,019,307; (9,4) 1,770; (10,4) 2,566; (11,4) 3,654; (14,3) 1,208; (14,8) 65,587,703; (14,10) 8,052,194,837; (16,10) 29,976,204,593. On 3 November 2026 each was larger than the entry for its (Delta, D) in the table maintained by F. Comellas. Adjacency lists for (9,4), (10,4), (11,4) and (14,3), built on graphs of F. Comellas; Cayley graph parameters for the other four; and two checkers, bpverify2.c and voltverify.c

提供机构:
Zenodo
创建时间:
2026-11-04
二维码
社区交流群
二维码
科研交流群
商业服务