Loading...
Loading...

Go to the content (press return)

Caterpillars are antimagic

Author
Lozano, A.; Mora, M.; Seara, C.; Tey, Joaquín
Type of activity
Report
Date
2018-12-18
Project funding
Combinatorics of networks and computation
URL
https://arxiv.org/abs/1812.06715 Open in new window
Abstract
An antimagic labeling of a graph G is an injection from E(G) to {1,2,…,|E(G)|} such that all vertex sums are pairwise distinct, where the vertex sum at vertex u is the sum of the labels assigned to edges incident to u. A graph is called antimagic when it has an antimagic labeling. Hartsfield and Ringel conjectured that every simple connected graph other than K2 is antimagic and the conjecture remains open even for trees. Here we prove that caterpillars are antimagic by means of an O(nlogn) alg...
Keywords
Antimagic labeling, Caterpillar
Group of research
CGA -Computational Geometry and Applications
COMBGRAPH - Combinatorics, Graph Theory and Applications
DCG - Discrete and Combinatorial Geometry

Participants