Автор(ы): Губко М. В. (ИПУ РАН, Лаборатория 11) НЕАКТУАЛЬНАЯ ЗАПИСЬMagnant C. (Georgia Southern University)Nowbandegani P. S. (Shiraz University)Gutman I. (Kraguevac University)Автор(ов): 4 Параметры публикацииТип публикации: Статья в журнале/сборникеНазвание: ABC Index of Trees with Fixed Number of LeavesISBN/ISSN: 0340-6253Наименование источника: Match: communications in mathematical and computer chemistryОбозначение и номер тома: Volume 74 (2015) number 3Город: KraguevacИздательство: Kraguevac UniversityГод издания: 2015Страницы: 697-701 АннотацияGiven a graph G, the atom-bond connectivity (ABC) index is defined to be ABC(G) = ..., where E(G) is the edge set of graph G and dG(v) is the degree of vertex v in graph G. The paper [6] claims to classify those trees with a fixed number of leaves which minimize the ABC index. Unfortunately, there is a gap in the proof leading to other examples that contradict the main result of that work. These examples and the problem are discussed in this work. Библиографическая ссылка: Губко М.В., Magnant C., Nowbandegani P.S., Gutman I. ABC Index of Trees with Fixed Number of Leaves // Match: communications in mathematical and computer chemistry. 2015. Volume 74 (2015) number 3. С. 697-701.