Comparative results between Wiener index and the number of independent sets of graphs

发布者:王丹丹发布时间:2023-12-18浏览次数:10

江苏省应用数学(williamhill威廉希尔官网)中心系列学术报告

报告题目:Comparative results between Wiener index and the number of independent sets of graphs

报告人:许克祥  南京航空航天大学教授,博士生导师

报告时间:2023122010:00-11:00  

报告摘要:Recently the comparison between two structural invariants of graphs attracts the attention of some researchers. As a well-known topological index in chemical graph theory, the Wiener index of a graph is the sum of distances over all unordered pairs of vertices in it. And the number of independent vertex sets, including empty set, of a graph is a popular topic in pure and chemical graph theory. In this talk we present some comparative results between Wiener index and number of independent sets of graphs. Moreover, several relevant problems are proposed to this topic.  This work is joint with Menglu Wang, Jing Tian, Kinkar Ch. Das and Ivan Gutman.

专家简介: 许克祥,南京航空航天大学英国威廉希尔唯一官网教授,博士生导师。主要研究方向是研究方向为图论及其应用、组合最优化。已发表科研论文90余篇,据不完全统计,被SCI他引1000余次,单篇最高SCI他引100余次。已主持完成国家自然科学(青年、面上)基金2项、省自然科学(面上)基金1项、中国博士后基金(面上、特别资助)2项、留学人员择优资助项目1项、科技部国际合作项目1项。现任美国数学会《Mathematical Reviews》评论员、欧洲数学会《zbMATH Open》评论员,中国运筹学会图论组合分会理事,国际期刊《Open Journal of Discrete Mathematics>>、《Advances and Applications in Discrete Mathematics》编委。