遇见数据集

Antimagic Labelings of All Trees of Order 3 to 25

收藏
Zenodo2023-07-14 更新2026-05-26 收录
数据链接:
官方服务:

资源简介:

This archive contains antimagic labelings for all trees of order 3 to 25 found by evolutionary search as described in the paper: Branson, L. and Sutton, A. M., <em>Finding Antimagic Labelings of Trees by Evolutionary Search</em>, 2023. https://doi.org/10.1145/3594805.3607133 The archive contains 1679 compressed sub-archives, each containing 100000 data files, except the last, which contains 79144 data files. The total number of data files is 167879144 (cf. the total number of unlabeled trees of order 3-25 in entry A000055 of the OEIS https://oeis.org/A000055). Each data file corresponds to a unique tree and is named <strong>tree-&lt;n&gt;-&lt;id&gt;.viz</strong> where <strong>&lt;n&gt;</strong> is the order (number of vertices) of the tree and <strong>&lt;id&gt;</strong> is a unique identifier for the tree of that order. Each data file is a text file written in the DOT graph description language that specifies the structure of the tree along with an edge labeling and vertex labeling that is antimagic.

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