This readme.txt file was generated on 2023-08-01 by Andrew M. Sutton Recommended citation for the data: 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, https://doi.org/10.13020/pnrb-cm94. ------------------- GENERAL INFORMATION ------------------- 1. Title of Dataset: Antimagic Labelings for Trees of Order 3 to 25 2. Author Information Author Contact: Andrew Sutton (amsutton@d.umn.edu) Name: Luke Branson Institution: University of Minnesota Duluth Email: brans109@d.umn.edu ORCID: 0009-0009-2781-266X Name: Andrew M Sutton Institution: University of Minnesota Duluth Email: amsutton@d.umn.edu ORCID: 0000-0003-1295-6715 3. Date published or finalized for release: 2023-07-14 4. Date of data collection (single date, range, approximate date): August 2022 to July 2023 5. Geographic location of data collection (where was data collected?): N/A 6. Information about funding sources that supported the collection of the data: National Science Foundation Grant No. 2144080 7. Overview of the data (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" -------------------------- SHARING/ACCESS INFORMATION -------------------------- 1. Licenses/restrictions placed on the data: CC0 1.0 Universal (http://creativecommons.org/publicdomain/zero/1.0/) 2. Links to publications that cite or use the data: https://doi.org/10.1145/3594805.3607133 3. Was data derived from another source? No If yes, list source(s): 4. Terms of Use: Data Repository for the U of Minnesota (DRUM) By using these files, users agree to the Terms of Use. https://conservancy.umn.edu/pages/drum/policies/#terms-of-use --------------------- DATA & FILE OVERVIEW --------------------- File List Filename: antimagic-tree-labelings.tar Short description: Tree Labeling Data 2. Relationship between files: See description below. -------------------------- METHODOLOGICAL INFORMATION -------------------------- 1. Description of methods used for collection/generation of data: The exhaustive unrooted tree generation procedure of Wright et al. (see https://doi.org/10.1137/0215039) was used to generate every tree of order n for each n in {3,4,...,25}. Subsequently, on each such tree, the (1+1) Evolutionary Algorithm using the exchange operator for mutation was run to find a feasible antimagic labeling, and the corresponding antimagic labeling was stored together with the tree structure data in a text file 'tree--.viz' where is the order of the tree and is a unique identifier. 2. Methods for processing the data: The files are combined into a single archive file named 'antimagic-tree-labelings.tar'. This archive contains 1679 sub-archives that have each been compressed using the xz compression utility. Each compressed archive bears the name 'trees-XXXX-output.tar.xz' where XXXX is a number from 0000 to 1678, and, when uncompressed, consists of a directory containing 100000 text files 'tree--.viz' as described above. Note that the final directory (trees-1678-output) contains only 79144 files. 3. Instrument- or software-specific information needed to interpret the data: Each tree file defines the structure of the corresponding tree together with the antimagic labeling (a labeling of both vertices and edges) in the DOT graph description language (defined in the Graphviz project). The tree with its antimagic labeling can be viewed and manipulated using any software that reads the DOT graph description languages such as the Graphviz package or Gephi. 4. Standards and calibration information, if appropriate: N/A 5. Environmental/experimental conditions: N/A 6. Describe any quality-assurance procedures performed on the data: N/A