✦ LIBER ✦

Wiener Distance Matrix for Alkanes

✍ Scribed by Smolenskii, E. A.

Book ID: 111579681
Publisher: Springer
Year: 2004
Tongue: English
Weight: 46 KB
Volume: 394
Category: Article
ISSN: 0012-5008
DOI: 10.1023/b:doch.0000013457.00025.ee

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The Wiener Distance Matrix for Acyclic C

The Wiener Distance Matrix for Acyclic Compounds and Polymers.

✍ Evgenii A. Smolenskii 📂 Article 📅 2004 🏛 John Wiley and Sons ⚖ 50 KB

The Wiener Distance Matrix for Acyclic C

The Wiener Distance Matrix for Acyclic Compounds and Polymers

✍ Smolenskii, E.A. 📂 Article 📅 2004 🏛 American Chemical Society 🌐 English ⚖ 86 KB

A new algorithm for computing distance m

A new algorithm for computing distance matrix and Wiener index of zig-zag polyhex nanotubes

✍ Ali Reza Ashrafi; Shahram Yousefi 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 232 KB

Mean Wiener Numbers and Other Mean Exten

Mean Wiener Numbers and Other Mean Extensions for Alkane Trees

✍ Bytautas, L.; Klein, D.J. 📂 Article 📅 2000 🏛 American Chemical Society 🌐 English ⚖ 110 KB

On the determinant of the adjacency-plus

On the determinant of the adjacency-plus-distance matrix as the topological index for characterizing alkanes

✍ Knop, Jan V.; Mueller, Wolfgang R.; Szymanski, K.; Trinajstic, Nenad 📂 Article 📅 1991 🏛 American Chemical Society 🌐 English ⚖ 237 KB

Preconditioners for distance matrix algo

Preconditioners for distance matrix algorithms

✍ W. Glunt; T. L. Hayden; M. Raydan 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 410 KB

A recent gradient algorithm in nonlinear optimization uses a novel idea that avoids line searches. This so-called spectral gradient algorithm works well when the spectrum of the Hessian of the function to be minimized has a small range or is clustered. In this article, we find a general precondition