Loading...
Loading...

Go to the content (press return)

Antimagic labelings of caterpillars

Author
Lozano, A.; Mora, M.; Seara, C.
Type of activity
Journal article
Journal
Applied mathematics and computation
Date of publication
2019-04-15
Volume
347
First page
734
Last page
740
DOI
https://doi.org/10.1016/j.amc.2018.11.043 Open in new window
Project funding
A unified theory of algorithmic relaxations
Combinatorics of networks and computation
Discrete and Combinatorial Geometry (DCG) Gen. Cat. DGR 2017SGR1336
Grafos y geometría: interacciones y aplicaciones
Repository
http://hdl.handle.net/2117/125781 Open in new window
https://arxiv.org/abs/1708.00624 Open in new window
URL
https://www.sciencedirect.com/science/article/abs/pii/S0096300318310178 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 K2 is antimagic, but the conjecture is still open even for trees. Here we study k-antimagic l...
Citation
Lozano, A., Mora, M., Seara, C. Antimagic labelings of caterpillars. "Applied mathematics and computation", 15 Abril 2019, vol. 347, p. 734-740.
Keywords
Antimagic graphs, Labelings
Group of research
CGA -Computational Geometry and Applications
COMBGRAPH - Combinatorics, Graph Theory and Applications
DCG - Discrete and Combinatorial Geometry

Participants