报告题目：The chromatic entropy of a p-uniform linear unicyclic hypergraph                                                      

主讲人：青海师范大学 邓波教授

时 间：2025年9月23日 下午14：00-17：00

地 点：腾讯会议：625-426-104    

摘 要：Graph entropy is originated from Shannon entropy, which is using for quantifying the complexity and uncertainty of networks and   is widely applied in fields such as information theory, communication theory and statistics. As a kind of classical graph entropy, the chromatic entropy of a graph plays an important key in describing the structures of networks.   Generally, a hypergraph is the extension of a graph, which is often used in characterising complex systems. In this research, we present the ones with maximal and minimal chromatic entropies of hypergraphs among $p$-uniform linear unicyclic hypergraphs. In addition, we give the corresponding expressions of the extremal hypergraphs for the chromatic entropy of a hypergraph.

报告人简介：邓波，博士，教授，南开大学博士后，青海省数学学会秘书长。主要研究领域为代数图论、化学图论。2017年入选青海省高端创新引进人才，同年入选青海省高端创新引进团队-图论与组合优化团队；2019年入选青海省自然科学与工程技术学科带头人；2021年评为青海省优秀专业技术人才。在国内外学术刊物发表论文70余篇，先后主持和参与国家级、省级科研项目10余项。担任美国数学评论评论员、《International Journal of Discrete Mathematics》期刊编委。2016年在国际数学化学大会作30分钟的邀请报告。