1241-1245Several approximate relations have recently been established between molecular-graph-based structure descriptors of alkanes, in particular between (a) eigenvalue sum and Hosoya index. (b) greatest graph eigenvalue and connectivity index, (c) Wiener index and smallest positive Laplacian eigenvalue, (d) greatest Laplacian and greatest ordinary graph eigenvalue, (e) Zenkevich and Wiener index, and (f) hyper-Wiener and Wiener index. These all have been found to hold for alkanes with n=10 or fewer carbon atoms, and have verified on samples consisting of all alkane isomers. Applying an algorithm for generating trees uniformly by random we have now tested these regularities for very large chemical trees (n =50). It has been found...
AbstractThe Wiener index of a graph is the sum of the distances between all pairs of vertices. It ha...
AbstractThe recently introduced atom–bond connectivity (ABC) index has been applied up to now to stu...
893-896If G is a molecular graph and A(G) its adjacency matrix, then the Laplacian matrix is defin...
569-573The distance matrix of an alkane has a unique positive eigenvalue A., which has recently been...
Abstract: The hyper-Wiener index WW of a chemical tree T is defined as the sum of the products n1n2,...
AbstractIn the drug design process, one wants to construct chemical compounds with certain propertie...
In the drug design process, one wants to construct chemical compounds with cer-tain properties. In o...
In the drug design process, one wants to construct chemical compounds with certain properties. In or...
Some new topological indices based on the distance matrix and Randic connectivity (as graph invarian...
723-728A structure-descriptor EE, recently proposed by Estrada, is examined. If λ₁, λ₂,..., λո are t...
The Wiener index is a topological index defined as the sum of distances between all pairs of vertice...
An algorithm with a complexity linear in the number of vertices is proposed for the computation of t...
The Wiener index of a graph is the sum of the distances between all pairs of vertices. It has been o...
A highly discriminating molecular topological index, EAID, is proposed based on the extended adjacen...
In a recent work [Chem. Phys. Lett. 333 (2001) 319-321] Nikolić, Trinajstić, and Randić put forward ...
AbstractThe Wiener index of a graph is the sum of the distances between all pairs of vertices. It ha...
AbstractThe recently introduced atom–bond connectivity (ABC) index has been applied up to now to stu...
893-896If G is a molecular graph and A(G) its adjacency matrix, then the Laplacian matrix is defin...
569-573The distance matrix of an alkane has a unique positive eigenvalue A., which has recently been...
Abstract: The hyper-Wiener index WW of a chemical tree T is defined as the sum of the products n1n2,...
AbstractIn the drug design process, one wants to construct chemical compounds with certain propertie...
In the drug design process, one wants to construct chemical compounds with cer-tain properties. In o...
In the drug design process, one wants to construct chemical compounds with certain properties. In or...
Some new topological indices based on the distance matrix and Randic connectivity (as graph invarian...
723-728A structure-descriptor EE, recently proposed by Estrada, is examined. If λ₁, λ₂,..., λո are t...
The Wiener index is a topological index defined as the sum of distances between all pairs of vertice...
An algorithm with a complexity linear in the number of vertices is proposed for the computation of t...
The Wiener index of a graph is the sum of the distances between all pairs of vertices. It has been o...
A highly discriminating molecular topological index, EAID, is proposed based on the extended adjacen...
In a recent work [Chem. Phys. Lett. 333 (2001) 319-321] Nikolić, Trinajstić, and Randić put forward ...
AbstractThe Wiener index of a graph is the sum of the distances between all pairs of vertices. It ha...
AbstractThe recently introduced atom–bond connectivity (ABC) index has been applied up to now to stu...
893-896If G is a molecular graph and A(G) its adjacency matrix, then the Laplacian matrix is defin...