Name
Abstract | ||
|---|---|---|
Let m >= 1 be an integer and G be a graph with m edges. We say that G has an antimagic orientation if G has an orientation D and a bijection tau : A(D) -> {1, 2, . . . , m} such that no two vertices in D have the same vertex-sum under tau, where the vertex-sum of a vertex u in D under tau is the sum of labels of all arcs entering u minus the sum of labels of all arcs leaving u. Hefetz et al. (2010) conjectured that every connected graph admits an antimagic orientation. The conjecture was confirmed for certain classes of graphs such as dense graphs, regular graphs, and trees including caterpillars and complete k-ary trees. In this note, we prove that every lobster admits an antimagic orientation. (C) 2020 Elsevier B.V. All rights reserved. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.dam.2020.07.019 | DISCRETE APPLIED MATHEMATICS |
Keywords | DocType | Volume |
Lobster, Antimagic labeling, Antimagic orientation | Journal | 287 |
ISSN | Citations | PageRank |
0166-218X | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yuping Gao | 1 | 0 | 1.35 |
| Songling Shan | 2 | 20 | 9.16 |