报告题目：Trees with minimal atom-bond connectivity index - recent theoretical and computational results

报告简介：The problem of characterizing trees with minimal atom-bond connectivity index is one of the most demanding open problems in chemical graph theory.

The problem is not yet completely solved, but there was significant progress in the last several years heading towards its final solution. We will give an overview of the recent theoretical results as well as an overview of some computational approaches, which help us to better understand the structure of the trees with minimal atom-bond connectivity index.

报告人：Darko Dimitrov 教授，德国柏林工程和经济应用技术大学

报告时间：2019年07月09日（星期二）下午 3:30

报告地点：扬州大学瘦西湖校区数学科学学院38号楼108报告厅

主办单位：扬州大学数学科学学院

欢迎广大师生参加！