報告題目：Trees with minimal atom-bond connectivity index - recent theoretical and computational results
報告人：Darko Dimitrov (研究員, Hochschule fuer Technik und Wirtschaft Berlin)
報告簡介：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 earned his PhD in computational geometry from the Free University of Berlin, Germany as a member of the Theoretical Computer Science Group at the Department of Mathamatics and Computer Science. He has been a researcher and lecturer at the Hochschule fuer Technik und Wirtschaft Berlin, the Rheinisches Studienkolleg Berlin, the Faculty of Information Studies in Novo mesto, and University American College Skopje. His main areas of interest include graph theory and computational geometry, together with their applications in chemistry, computer graphics and computer vision.