遇见数据集

Complete Enumeration of Connected Graph Isomers up to 11 Vertices (Base-36 Format)

收藏
Zenodo2025-05-30 更新2026-05-26 收录
官方服务:

资源简介:

This dataset provides the complete enumeration of connected graph isomers with 5 to 11 vertices.Each isomer is represented by a base-36 encoded string of its adjacency matrix, with isomorphic duplicates removed.For n = 11, the data is split by edge count into separate ZIP files due to size limitations.The dataset is intended for research in graph theory, chemical graph analysis, and algorithm benchmarking.Accompanying scripts and usage documentation are included for decoding and interpretation.## Changes in Version 2- Corrected ORCID ID of S. Taki## Changes in Version 3-The name Rika Sekine was incorrectly ordered as GivenName: Sekine / FamilyName: Rika, but the correct order is FamilyName: Sekine/ GivenName: Rika. This has been corrected in the current version.-Corrected an incorrect DOI reference for Wang et al. in the last three digits. These have been updated to the correct value.

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