Antimagic orientations for the complete k-ary trees

Chen Song () and Rong-Xia Hao ()
Additional contact information
Chen Song: Beijing Jiaotong University
Rong-Xia Hao: Beijing Jiaotong University

Journal of Combinatorial Optimization, 2019, vol. 38, issue 4, No 6, 1077-1085

Abstract: Abstract A labeling of a digraph D with m arcs is a bijection from the set of arcs of D to $$\{1,2,\ldots ,m\}$$ { 1 , 2 , … , m } . A labeling of D is antimagic if all vertex-sums of vertices in D are pairwise distinct, where the vertex-sum of a vertex $$u \in V(D)$$ u ∈ V ( D ) for a labeling is the sum of labels of all arcs entering u minus the sum of labels of all arcs leaving u. Hefetz et al. (J Graph Theory 64:219–232, 2010) conjectured that every connected graph admits an antimagic orientation. We support this conjecture for the complete k-ary trees and show that all the complete k-ary trees $$T_k^r$$ T k r with height r have antimagic orientations for any k and r.

Keywords: Complete k-ary tree; Antimagic labeling; Antimagic orientation (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00437-7 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:38:y:2019:i:4:d:10.1007_s10878-019-00437-7

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-019-00437-7

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().