首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到20条相似文献,搜索用时 0 毫秒
1.
Topological indices are graph invariants used in computational chemistry to encode molecules. A frequent problem when performing structure-activity studies is that topological indices are inter-correlated. We consider a simple topological index and show asymptotic independence for a random tree model. This continues previous work on the correlation among topological indices. These findings suggest that a size-dependence in a certain class of distance-based topological indices can be eliminated.AMS subject classification: 05C80, 60E10, 92E10  相似文献   

2.
Three newly defined information theoretic topological indices, namely “degree complexity (Id),” “graph vertex complexity (HV),” and “graph distance complexity (HD)” along with three other information indices have been used to study their discriminating power of 45 trees and 19 monocyclic graphs. It is found that the newly defined indices have satisfactory discriminating power while HD has been found to be the only index to discriminate all the graphs studied.  相似文献   

3.
4.
5.
Recently, four new types of vertex invariants, namelyu, v, x, andy, were defined on the basis of information on graph distances. They were combined to give four highly selective topological indices:U, V, X, andY. The degeneracy, i.e. equal values for nonisomorphic graphs, of the four topological indices is investigated. A structural condition and a graphical method which gives pairs of molecular graphs with identicalU, V, X, andY topological indices are introduced. The smallest pair of 4-trees representing alkanes having degeneratedU, V, X, andY values consists of trees with eighteen vertices.  相似文献   

6.
By applying information theory to the set of topological distances from one vertex to all other graph vertices, one obtains four new types of vertex invariants (u i,v i,x i,Y i) which are real numbers (as opposed to integers). They may be combined in many ways to afford new topological indices. One such type leads to indicesU, V, X andY which show no degeneracy for alkanes with up to 15 vertices.  相似文献   

7.
A new procedure (GENLOIS) is presented for generating trees or certain classes of trees such as 4-trees (graphs representing alkanes), identity trees, homeomorphical irreducible trees, rooted trees, trees labelled on a certain vertex (primary, secondary, tertiary, etc.). The present method differs from previous procedures by differentiating among the vertices of a given parent graph by means of local vertex invariants (LOVIs). New graphs are efficiently generated by adding points and/or edges only to non-equivalent vertices of the parent graph. Redundant generation of graphs is minimized and checked by means of highly discriminating, recently devised topological indices based either on LOVIs or on the information content of LOVIs. All trees onN + 1 (N + 1 < 17) points could thus be generated from the complete set of trees onN points. A unique cooperative labelling for trees results as a consequence of the generation scheme. This labelling can be translated into a code for which canonical rules were recently stated by A.T. Balaban. This coding appears to be one of the best procedures for encoding, retrieving or ordering the molecular structure of trees (or alkanes).Dedicated to Professor Alexandru T. Balaban on the occasion of his 60th anniversary.  相似文献   

8.
9.
We consider the role that individual bonds play in bond-additivities in order to better understand the structural basis of various topological indices. In particular we consider indices closely related to the Wiener index (W) and the distance matrix and search for optimal weights of terminal and interior CC bonds in alkanes for a selection of physicochemical properties. It is interesting to note that different properties are associated with different relative roles of the exterior and the interior CC bonds.  相似文献   

10.
Let G be a graph with n vertices and d i is the degree of its ith vertex (d i is the degree of v i). In this article, we compute the redefined first Zagreb index, redefined second Zagreb index, redefined third Zagreb index, augmented Zagreb index of graphs carbon nanocones CNC k[n], and nanotori [C4C6C8(p,q)]. Also, compute the multiplicative redefined first Zagreb index, multiplicative redefined second Zagreb index, multiplicative redefined third Zagreb index, multiplicative augmented Zagreb index of carbon nanocones CNC k[n], and nanotori [C4C6C8(p,q)].  相似文献   

11.
12.
The Winer and Schultz three-dimensional topological indices of alkanes are considered and compared with ordinary two-dimensional indices. Methods of index design and details of calculations are discussed. Unlike two-dimensional indices, three-dimensional ones adequately reflect differences between both structural and rotational isomers. Regression analysis of property-index correlations for formation enthalpy, molar volume, evaporation heat, and boiling temperature is performed using various two- and three-parameter (linear, quadratic, exponential, logarithmic, and power) functions. The ability of three-dimensional indices to correlate with these properties is found to be as good as that of two-dimensional ones. Tver State University. Translated fromZhurnal Strukturnoi Khimii, Vol. 39, No. 3, pp. 484–492, May–June, 1998. This work was supported by RFFR grant No. 96-03-32384.  相似文献   

13.
A novel method is suggested for constructing topological indices (TIs) of molecular graphs which models human logic. This method is described in terms of a block scheme, consisting of the mutually connected elementary blocks. In each block the simple transformations of a molecular graph are fulfilled. A variant of the transformation is selected from the list of possible variants. Every TI is obtained as a result of the sequential execution of a number of operations, corresponding to some ‘walk’ on the block scheme. This walk can be selected both randomly and by the investigator. The suggested method can serve as a basis for the development of the respective computer program which may be used for the automatic construction of any number of TIs of differing nature. By this process one can also obtain the TIs that are unlikely to be constructed manually, due to their complexity. The set of obtained TIs may be used for building the structure–property models. In the case of an unsatisfactory result the obtained set of TIs may be changed using the described generator of TIs. A number of examples of application of the suggested approach for the building QSAR/QSPR models is given.  相似文献   

14.
15.
Among the 16 expressions derived in the recent paper [Int. J. Quantum Chem. 2020 , 120(6), e26082] for calculating certain degree-based topological indices of the molecular graphs of carbon nanocones and nanotori, 12 expressions contain some mistakes, and the remaining 4 follow from an already existing general expression. In this note, the correct versions of the aforementioned erroneous expressions are obtained.  相似文献   

16.
17.
A new extension of the generalized topological indices (GTI) approach is carried out to represent “simple” and “composite” topological indices (TIs) in an unified way. This approach defines a GTI-space from which both simple and composite TIs represent particular subspaces. Accordingly, simple TIs such as Wiener, Balaban, Zagreb, Harary and Randić connectivity indices are expressed by means of the same GTI representation introduced for composite TIs such as hyper-Wiener, molecular topological index (MTI), Gutman index and reverse MTI. Using GTI-space approach we easily identify mathematical relations between some composite and simple indices, such as the relationship between hyper-Wiener and Wiener index and the relation between MTI and first Zagreb index. The relation of the GTI-space with the sub-structural cluster expansion of property/activity is also analysed and some routes for the applications of this approach to QSPR/QSAR are also given.  相似文献   

18.
19.
20.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号