Loading...
Loading...

Go to the content (press return)

Trees whose even-degree vertices induce a path are antimagic

Author
Lozano, A.; Mora, M.; Seara, C.; Tey, Joaquín
Type of activity
Report
Date
2019-05-16
Project funding
A unified theory of algorithmic relaxations
Combinatorics of networks and computation
Discrete and Combinatorial Geometry (DCG) Gen. Cat. DGR 2017SGR1336
Geometry and graphs: interactions and applications
Repository
http://hdl.handle.net/2117/133369 Open in new window
URL
https://arxiv.org/pdf/1905.06595.pdf Open in new window
Abstract
An antimagic labeling of a connected graph G is a bijection from the set of edges E(G) to {1, 2, . . . , |E(G)|} such that all vertex sums are pairwise distinct, where the vertex sum at vertex v is the sum of the labels assigned to edges incident to v. A graph is called antimagic if it has an antimagic labeling. In 1990, Hartsfield and Ringel conjectured that every simple connected graph other than K2 is antimagic; however, the conjecture remains open, even for trees. In this note we prove that ...
Citation
Lozano, A. [et al.]. "Trees whose even-degree vertices induce a path are antimagic". 2019.
Keywords
Antimagic labeling, Graph, Tree
Group of research
CGA -Computational Geometry and Applications
COMBGRAPH - Combinatorics, Graph Theory and Applications
DCG - Discrete and Combinatorial Geometry

Participants

Attachments