Loading...
Loading...

Go to the content (press return)

Antimagic labelings of caterpillars

Author
Lozano, A.; Mora, M.; Seara, C.
Type of activity
Report
Date
2019-01-08
Project funding
Combinatorics of networks and computation
URL
https://arxiv.org/pdf/1708.00624.pdf Open in new window
Abstract
A k-antimagic labeling of a graph G is an injection from E(G) to {1, 2, . . . , |E(G)|+k} 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. We call a graph k-antimagic when it has a k-antimagic labeling, and antimagic when it is 0-antimagic. Hartsfield and Ringel conjectured that every simple connected graph other than K_2 is antimagic, but the conjecture is still open even for trees. Here we study k-antima...
Keywords
Antimagic labeling, Caterpillar
Group of research
CGA -Computational Geometry and Applications
COMBGRAPH - Combinatorics, Graph Theory and Applications
DCG - Discrete and Combinatorial Geometry

Participants