57
Views
23
CrossRef citations to date
0
Altmetric
Original Articles

Overall Molecular Descriptors. 3. Overall Zagreb Indices

&
Pages 213-236 | Received 30 Sep 2000, Accepted 09 Nov 2000, Published online: 27 Oct 2006
 

Abstract

This paper develops further the concept of overall characterization of molecular topology, which is based on calculation of a given graph-invariant for all subgraphs of molecular graph. The new approach defines a cumulative topological descriptor, and an ordered series of terms (eth-order descriptor), which present the sum of the graph-invariant values for all subgraphs having the same number of edges. Alternatively, the terms in the series may be further partitioned, in the manner of molecular connectivity concept of Randič, Kier, and Hall, into contributions of path, cluster, and path-cluster type of subgraphs. The previous publications on the novel approach were based on the simplest graph-invariants - the sum of entries of the adjacency matrix and the distance matrix. Overall connectivity and overall Wiener index were thus defined, along with their respective series of e-order terms. The present study makes use of two other simple functions of vertex degrees, the first and second Zagreb indices. The overall versions of these two indices, very recently constructed, are analyzed in detail. Their potential applicability is verified by deriving multilinear regression models of ten physicochemical properties of alkanes, and comparing them to the results obtained by molecular connectivity and overall connectivity indices.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.