报告名称：

Some results on the Zagreb Indices of k-trees

报告作者：

卫兵

作者简介：

所在学校：

密西西比大学

职称：

教授

其他

报告时间：

2015年10月26日（星期一）上午10：00-11：00

报告地点：

数统学院203

报告摘要：

The Zagreb indices have been the focus of considerable research in computational chemistry dating back to Gutman and Trinajstic in 1972. In 2004, Das and Gutman determined sharp upper and lower bounds for M1 and M2 values for trees along with the unique trees that obtain the minimum and maximum M1 and M2 values respectively. In this talk, we will extend the results of Das and Gutman to the generalized tree, the k-tree, where the results of Das and Gutman are for k = 1. By showing that maximal outerplanar graphs are 2-trees, we also obtain a generalization of a result of Hou, Li, Song, and Wei who determined sharp upper and lower bounds for M1 and M2 values for maximal outerplanar graphs. Some recent work on multiplicative Zagreb indices will also be presented.