✦ LIBER ✦

Hyper-Wiener index for acyclic structures

✍ Scribed by A. A. Dobrynin; I. Gutman; V. N. Piottukh-Peletskii

Book ID: 105650270
Publisher: SP MAIK Nauka/Interperiodica
Year: 1999
Tongue: English
Weight: 378 KB
Volume: 40
Category: Article
ISSN: 0022-4766
DOI: 10.1007/bf02903659

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Hyper-Wiener Index vs. Wiener Index. Two

Hyper-Wiener Index vs. Wiener Index. Two Highly Correlated Structure-Descriptors

✍ Ivan Gutman; Boris Furtula 📂 Article 📅 2003 🏛 Springer Vienna 🌐 English ⚖ 288 KB

On the Definition of the Hyper-Wiener In

On the Definition of the Hyper-Wiener Index for Cycle-Containing Structures

✍ Klein, D. J.; Lukovits, I.; Gutman, I. 📂 Article 📅 1995 🏛 American Chemical Society 🌐 English ⚖ 261 KB

The Overall Hyper-Wiener Index

✍ X.H. Li; J.J. Lin 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 69 KB

Description of cyclic and branched-acycl

Description of cyclic and branched-acyclic hydrocarbons by variants of the hyper-Wiener index

✍ W. Linert; K. Kleestorfer; F. Renz; I. Lukovits 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 589 KB

An algorithm for the computation of the

An algorithm for the computation of the hyper-Wiener index for the characterization and discrimination of branched acyclic molecules

✍ W. Linert; F. Renz; K. Kleestorfer; I. Lukovits 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 483 KB

The hyper-Wiener index of graph operatio

The hyper-Wiener index of graph operations

✍ M.H. Khalifeh; H. Yousefi-Azari; A.R. Ashrafi 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 271 KB

## Graph operations C 4 nanotube C 4 nanotorus q-multi-walled nanotube a b s t r a c t Let G be a graph. The distance d(u, v) between the vertices u and v of the graph G is equal to the length of a shortest path that connects u and v. The Wiener index W(G) is the sum of all distances between verti