Antimagic orientations for some graphs
报告题目(Title)：Antimagic orientations for some graphs
报告人(Speaker)：郝荣霞（北京交通大学）
地点(Place)：后主楼1124
时间(Time)：2019年11月8日 17:00-18:00
邀请人(Inviter)：徐敏
报告摘要
A labeling of a digraph D with m arcs is a bijection from the set of arcs of D to {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 ∈ 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. A graph G admits an antimagic orientation, if an orientation D of the graph G has an antimagic labeling. Hefetz, Mutze and Schwartz in [J. Graph Theory 64(2010)219-232] conjectured that every connected graph admits an antimagic orientation. In this talk, some known results which support this conjecture are given. Further more, we show that all the complete k-ary trees T^r_k with height r have antimagic orientations for any k and r.
