On the three-dimensional wiener number
✍ Scribed by B. Bogdanov; S. Nikolić; N. Trinajstić
- Publisher
- Springer
- Year
- 1989
- Tongue
- English
- Weight
- 609 KB
- Volume
- 3
- Category
- Article
- ISSN
- 0259-9791
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
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
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