کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
8900607 | 1631718 | 2018 | 10 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Computer search for large trees with minimal ABC index
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات کاربردی
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Computer search for large trees with minimal ABC index Computer search for large trees with minimal ABC index](/preview/png/8900607.png)
چکیده انگلیسی
The atom-bond connectivity (ABC) index of a graph Gâ¯=â¯(V, E) is defined as ABC(G)=âvivjâE(di+djâ2)/(didj), where Vâ¯=â¯{v0,v1,â
â
â
, vnâ¯ââ¯1} and di denotes the degree of vertex vi of G. This molecular structure descriptor found interesting applications in chemistry, and has become one of the most actively studied vertex-degree-based graph invariants. However, the problem of characterizing n-vertex tree(s) with minimal ABC index remains open and was coined as the “ABC index conundrum”. In attempts to guess the general structure of such trees, several computer search algorithms were developed and tested up to nâ¯=â¯800. However, for large n, all current search programs seem too powerless. For example, the fastest one up to date reported recently in [30] costs 2.2 h for nâ¯=â¯800 on a single PC with two CPU cores. In this paper, we significantly refine the known features of the degree sequence of a tree with minimal ABC index. With the refined features a search program was implemented with OpenMP. Our program was tested on a single PC with 4 CPU cores, and identified all n-vertex tree(s) with minimal ABC index up to nâ¯=â¯1100 within 207.1 h. Some observations are made based on the search results, which indicate some possible directions in further investigation of the problem of characterizing n-vertex tree(s) with minimal ABC index.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Applied Mathematics and Computation - Volume 338, 1 December 2018, Pages 221-230
Journal: Applied Mathematics and Computation - Volume 338, 1 December 2018, Pages 221-230
نویسندگان
Lin Wenshui, Chen Jianfeng, Wu Zhixi, Darko Dimitrov, Huang Linshan,