According to the definitions of molecular connectivity and hyper-Wiener index, a novel set of hyper-Wiener indexes （Dn, ^mDn） were defined and named as condensed extended hyper-Wiener index, the potential usefulness...According to the definitions of molecular connectivity and hyper-Wiener index, a novel set of hyper-Wiener indexes （Dn, ^mDn） were defined and named as condensed extended hyper-Wiener index, the potential usefulness of which in QSAR/QSPR is evaluated by its correlation with a number of C3-C8 alkanes as well as by a favorable comparison with models based on molecular connectivity index and overall Wiener index.展开更多
In this paper, in terms of Wiener index, hyper-Wiener index and Harary index, we first give some sufficient conditions for a nearly balance bipartite graph with given minimum degree to be traceable. Secondly, we estab...In this paper, in terms of Wiener index, hyper-Wiener index and Harary index, we first give some sufficient conditions for a nearly balance bipartite graph with given minimum degree to be traceable. Secondly, we establish some conditions for a k-connected graph to be Hamilton-connected and traceable for every vertex, respectively.展开更多
文摘According to the definitions of molecular connectivity and hyper-Wiener index, a novel set of hyper-Wiener indexes （Dn, ^mDn） were defined and named as condensed extended hyper-Wiener index, the potential usefulness of which in QSAR/QSPR is evaluated by its correlation with a number of C3-C8 alkanes as well as by a favorable comparison with models based on molecular connectivity index and overall Wiener index.
基金Supported by the Natural Science Foundation of China under Grant no(11871077)the NSF of Anhui Province of China under Grant no(1808085MA04)the Natural Science Foundation of Department of Education of Anhui Province of China under Grant no(KJ2017A362)
文摘In this paper, in terms of Wiener index, hyper-Wiener index and Harary index, we first give some sufficient conditions for a nearly balance bipartite graph with given minimum degree to be traceable. Secondly, we establish some conditions for a k-connected graph to be Hamilton-connected and traceable for every vertex, respectively.
