报告题目： From Friendship Graph to Mixed Extension
报 告 人：王建锋教授 山东理工大学
报告时间：2021年5月31日 14:00-15:00
报告地点：数学楼三楼天元数学东北中心第五研讨室
校内联系人：孙晓松 sunxs@jlu.edu.cn
报告摘要： In 2010, it was conjectured that the friendship graphs are determined by the adjacency spectra. In 2013, Das claimed that he proved the conjecture. However, his proof was found to be incorrect since the interlace theorem was misused. Determining the graphs with all but two eigenvalues equal to ±1, Cioaba et al. completely solved this conjecture in 2015. Inspired by the methods used in their paper, Cioaba et al. further investigated the related problems, and Haemers posed a new method named as the mixed extension of graphs. In this report, the old and new results involving the above topics will be summarized and introduced.
报告人简介：王建锋，山东理工大学数学与统计学院教授，博士生导师，担任中华全国青年联合会第十二届委员会委员、中国科学技术协会第九次全国代表大会代表委员、中国青年科技工作者协会第五届理事会理事、中国运筹学会图论与组合分会第四届理事会青年理事、青海数学学会第十届理事会秘书长等。主要研究领域是图论及其应用，侧重于代数图论方面的研究，主要包括图的谱理论及其应用和图的多项式理论及其应用等。担任美国“数学评论”评论员和十余种SCI源期刊和核心期刊审稿人。曾获青海省“昆仑英才”计划科技创新领军人才，青海省自然科学与工程学科带头人，第17届青海青年五四奖章。
