Antimagic orientations for the complete k-ary trees

Journal of Combinatorial Optimization, pp. 1077-1085, 2019.

Cited by: 0|Bibtex|Views1|Links
EI
Keywords:
Complete k-ary tree Antimagic labeling Antimagic orientation

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\}$ . A labeling of D is antimagic if all vertex-sums of vertices in D are pairwise dis...More

Code:

Data:

Your rating :
0

 

Tags
Comments