Carregant...
Carregant...

Vés al contingut (premeu Retorn)

Antimagic labelings of caterpillars

Autor
Lozano, A.; Mora, M.; Seara, C.
Tipus d'activitat
Article en revista
Revista
Applied mathematics and computation
Data de publicació
2019-04-15
Volum
347
Pàgina inicial
734
Pàgina final
740
DOI
https://doi.org/10.1016/j.amc.2018.11.043 Obrir en finestra nova
Projecte finançador
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
Repositori
http://hdl.handle.net/2117/125781 Obrir en finestra nova
https://arxiv.org/abs/1708.00624 Obrir en finestra nova
URL
https://www.sciencedirect.com/science/article/abs/pii/S0096300318310178 Obrir en finestra nova
Resum
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...
Paraules clau
Antimagic graphs, Labelings
Grup de recerca
CGA -Computational Geometry and Applications
COMBGRAPH - Combinatòria, Teoria de Grafs i Aplicacions
DCG - Discrete and Combinatorial Geometry

Participants