𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The Wiener number of the hexagonal net

✍ Scribed by W.C. Shiu; Peter C.B. Lam

Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
506 KB
Volume
73
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

✦ Synopsis

The Wiener number of a molecular graph, or more generally of a connected graph, is equal to the sum of distances between all pairs of its vertices. A graph formed by a hexagon in the centre, surrounded by n rings of hexagonal cells, is called an n-hexagonal net. It is shown that the Wiener number of an n-hexagonal net equals i( 164n5 -30n3 + n).

πŸ“œ SIMILAR VOLUMES

On the number of hexagonal polyominoes
On the number of hexagonal polyominoes
✍ Markus VΓΆge; Anthony J. Guttmann πŸ“‚ Article πŸ“… 2003 πŸ› Elsevier Science 🌐 English βš– 570 KB

A combination of the reΓΏned ΓΏnite lattice method and transfer matrices allows a radical increase in the computer enumeration of polyominoes on the hexagonal lattice (equivalently, site clusters on the triangular lattice), pn with n hexagons. We obtain pn for n 6 35. We prove that pn = n+o(n) , obtai

Trees with the minimum Wiener number
Trees with the minimum Wiener number
✍ Shu-Chung Liu; Li-Da Tong; Yeong-Nan Yeh πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 283 KB

The Wiener number (W) of a connected graph is the sum of distances for all pairs of vertices. As a graphical invariant, it has been found extensive application in chemistry. Considering the family of trees with n vertices and a fixed maximum vertex degree, we derive some methods that can strictly re

On the three-dimensional wiener number
On the three-dimensional wiener number
✍ B. Bogdanov; S. NikoliΔ‡; N. TrinajstiΔ‡ πŸ“‚ Article πŸ“… 1989 πŸ› Springer 🌐 English βš– 609 KB