学术报告:The non-odd-bipartiteness of even uniform hypergraphs

报告题目: The non-odd-bipartiteness of even uniform hypergraphs.

摘要:It is known that for a simple graph the bipartiteness can be characterized by the spectrum of the adjacency matrix, Laplaican matrix or signless Laplacian matrix of the graph. Shao et al. characterized the odd-bipartiteness of even uniform hypergraphs by the H-spectrum, spectrum of the adjacency tensor, Laplacian tensor or signless Laplacian tensor of the hypergraph.

In this talk we find two differences between the Laplacian spectrum and signless Laplaican spectrum of simple graphs and hypergraphs.

We also characterized the non-odd-bipartiteness of hypergraphs by means of the spectrum.

报告人:范益政,男,教授,博士,博士生导师,教育部新世纪优秀人才,安徽省学术和技术带头人,中国运筹学会图论组合学分会常务理事,安徽省数学会常务理事,安徽大学数学科学学院院长。

主要研究方向:代数组合与谱图理论。主持国家自然科学基金项目,发表论文100余篇。

报告时间:2017年4月19日下午3点

报告地点:学院会议室