【10/28專題演講】梁育菖-Anti-magic labeling of graph

【10/28專題演講】梁育菖-Anti-magic labeling of graph圖片
題目: Anti-magic labeling of graph
講者:梁育菖(本系博士後研究員)
時間:10/28 (三) 下午 3:40-4:30
地點:五育樓401教室
摘要:
An anti-magic labeling of a graph G is a one-to-one correspondence between the edge set E of G and the set {1,2, ..., |E|} of integers such that the sum of the labels assigned to edges incident to distinct vertices are different. If G has an anti-magic labeling, then G is called anti-magic. This talk will introduce backgrounds and present some recent results.