From Friendship Graph to Mixed Extension

活动时间： 05月29日09时00分       

地            点  ： 腾讯会议：252 825 851

讲座内容：

In 2010, it was conjectured that the friendship graphsare determined by the adjacency spectra. In 2013, Das claimed that he provedthe conjecture. However, his proof was found to be incorrect since theinterlace theorem was misused.   Determiningthe graphs with all but two eigenvalues equal to ±1,Cioaba et al. completelysolved this conjecture in 2015. Inspired by the methods used in their paper,Cioaba et al. further investigated the related problems, and Haemers posed anew method named as the mixed extension of graphs. In this report, the old andnew results involving the above topics will be summarized and introduced.

主讲人介绍：

王建锋，山东理工大学教授，新疆大学博士、南开大学博士后，发表论文60余篇，现主持一项国家自然科学基金面上项目，主持完成国家自然科学基金地区科学基金和青年基金各1项，主持完成中国博士后科学基金面上项目和省级自然科学基金3项、参与完成3项国家自然科学基金。发表的部分结果被英国剑桥大学出版社和国际学术出版社爱思唯尔（Elsevier）的专著收录。提出的问题得到荷兰、美国和韩国等知名图论专家的关注和彻底解决；多次应邀参加国内外学术会议，并应邀在塞尔维亚第14届数学大会作邀请报告等。现任中国科协九大代表，中国博士后和北京省市等自然科学基金通讯评审专家。目前主要侧重于研究图谱理论、图多项式理论、图距离参数等方向。曾获青海省“昆仑英才”计划科技创新领军人才、青海青年五四奖章等。

发布时间：2021-05-28 16:02:02