网站首页  |  实验室概况  |  研究团队  |  新闻中心  |  学术交流  |  学术报告  |  实验室年报  |  联系我们

 
 
  当前位置:首页 -> 学术报告
吴文俊数学重点实验室组合图论系列讲座之九十三【范益政】
报告题目: On the non-odd-bipartiteness of even uniform hypergraphs.

报告人:范益政 (安徽大学)

时间:12月8号  3:30-4:30 

地点:1518

摘要:

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.
中国科学院吴文俊数学重点实验室