数学学科学术报告(李学良 南开大学)

发布者:段玉玲   发布时间:2018-01-16  浏览次数:209

报 告 人:南开大学 李学良教授

报告题目:Conflict-free connections of graphs

报告时间:2017120日(周六)1530-1630

报告地点:21427报告厅


摘要: An edge-colored graph G is said to be conflict-free connected if between each pair of distinct vertices of G, there exists a path in G containing a color that is  used on exactly one edge of the path. The conflict-free connection number of a connected graph G, denoted by cfc(G), is defined as the smallest number of colors that are needed in order to make G conflict-free connected. These concepts have some potential use in connection with frequency assignment problems for cellular networks. This talk aims to give a survey of the known results and some open problems along with this subject.

报告人简介:

  李学良教授,博士生导师。现任南开大学组合数学中心副主任,中国组合数学与图论学会理事长,天津市工业与应用数学学会理事长,天津市数学会副理事长,中国数学会理事,中国工业与应用数学学会理事。《Discrete Applied Mathematics》、《Graphs and Combinatorics》和《MATCH Communications in Mathematical and in Computer Chemistry》等10余种国际杂志编委,《应用数学学报(中、英文版)》和《数学进展》国内杂志编委。主要从事图论与组合优化、化学图论、计算机科学理论方面的研究工作,在所研究领域的多种重要学术期刊上发表论文300余篇,4500余篇次被国内外同行学者的论著引用,在国外出版著作9部。




联系电话:0579-82298188(学院办) 0579-82298900(教务办) 0579-82298887(学工办)
浙江师范大学数理与信息工程学院 地址:浙江省金华市迎宾大道688号 邮编:321004 管理登陆
Copyright?2011 mpi.zjnu.net.cn All rights Reserved