Antimagic Labelings for Trees of Order 3 to 25

Loading...
Thumbnail Image
Statistics
View Statistics

Collection period

2022-08
2023-07

Date completed

Date updated

Time period coverage

Geographic coverage

Source information

Journal Title

Journal ISSN

Volume Title

Title

Antimagic Labelings for Trees of Order 3 to 25

Published Date

2023-07-14

Author Contact

Sutton, Andrew
amsutton@d.umn.edu

Type

Dataset
Other Dataset

Abstract

This dataset contains antimagic labelings of all trees of order 3 to 25 as described in the paper "Finding Antimagic Labelings of Trees by Evolutionary Search"

Description

The archive contains 1679 compressed files, each containing 100000 text files, except the last compressed file which contains 79144 text files. This is a total of 167879144 text files, corresponding to the 167879144 unlabeled trees from order 3 to order 25 (cf. entry A000055 in The On-Line Encyclopedia of Integer Sequences). Each text file is named tree-<n>-<id>.viz where <n> is the order of the tree (number of vertices) and <id> is a unique identifier. Each text file represents a unique tree with labeled vertices and edges in the DOT graph description language. The vertex/edge labeling corresponds to an antimagic labeling found by an evolutionary algorithm as presented in the paper "Finding Antimagic Labelings of Trees by Evolutionary Search" by L. Branson and A. M. Sutton. https://doi.org/10.1145/3594805.3607133

Referenced by

https://doi.org/10.1145/3594805.3607133

Related to

Replaces

item.page.isreplacedby

Publisher

Funding information

National Science Foundation Grant No. 2144080

item.page.sponsorshipfunderid

item.page.sponsorshipfundingagency

item.page.sponsorshipgrant

Previously Published Citation

Other identifiers

Suggested citation

Branson, Luke; Sutton, Andrew M. (2023). Antimagic Labelings for Trees of Order 3 to 25. Retrieved from the Data Repository for the University of Minnesota (DRUM), https://doi.org/10.13020/pnrb-cm94.

Content distributed via the University Digital Conservancy may be subject to additional license and use restrictions applied by the depositor. By using these files, users agree to the Terms of Use. Materials in the UDC may contain content that is disturbing and/or harmful. For more information, please see our statement on harmful content in digital repositories.