Super edge-magic labelings of all trees on 18, 19 and 20 vertices (certificates)
收藏官方服务：
资源简介：
Explicit super edge-magic labelings for every unlabeled tree on 18, 19 and 20 vertices (123867, 317955 and 823065 trees; OEIS A000055). Each line gives a tree's edges and a vertex labeling onto {1..n} whose n-1 edge sums are consecutive integers. Together with Lee and Shan's computer verification up to 17 vertices (Gallian, Dynamic Survey of Graph Labeling DS6, 28th ed., Section 5.2), this shows every tree on at most 20 vertices is super edge-magic. Produced as a V3R1T4S (github.com/elder-plinius/V3R1T4S) contribution. Archive sha256: 390d1698ff6e9563ed2e41a645cff865a05ab6b5427ece910e5bdda6ed82cc8b
提供机构：
Zenodo创建时间：
2026-11-03
