当前位置: 首页 > 学术报告
- 运筹控制分论坛
Distance three labellings of graphs
Dr Sanming Zhou
2018-01-01 12:13  华东师范大学

运筹与控制组学术报告
报 告 人: Dr Sanming Zhou
(Department of Mathematics and Statistics, The University of Melbourne,Australia)
报告人简介:周三明博士目前是墨尔本大学的Reader. 他在离散数学许多领域(如Algebraic Combinatorics, Combinatorial Optimization, Random Graph Processes and Randomized Algorithms)做出过出色成果,他曾获得2003年 Kirkman 奖。
时 间:2011年11月3日(星期四)下午13:00-14:00
地 点:闵行校区数学楼129教室
报告题目: Distance three labellings of graphs
摘要: Let h be a positive integer. An L(h,1,1)-labelling of a (finite or infinite) graph is an assignment of nonnegative integers (labels) to its vertices such that adjacent vertices receive labels with difference at least h, and vertices distance two or three apart receive distinct labels. The span of such a labeling is the difference between the maximum and minimum labels used. Motivated by applications in frequency assignment, the L(h,1,1)-labelling problem seeks for the minimum span over all L(h,1,1)-labellings of a graph together with an optimal L(h,1,1)-labelling.
In this talk I will review recent progress on the L(h,1,1)-labelling problem.

欢迎广大师生参加!