Cargando…
A new algorithm for computing distance matrix and Wiener index of zig-zag polyhex nanotubes
The Wiener index of a graph G is defined as the sum of all distances between distinct vertices of G. In this paper an algorithm for constructing distance matrix of a zig-zag polyhex nanotube is introduced. As a consequence, the Wiener index of this nanotube is computed.
| Autores principales: | , |
|---|---|
| Formato: | Online Artículo Texto |
| Lenguaje: | English |
| Publicado: |
Springer
2007
|
| Materias: | |
| Acceso en línea: | https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3246226/ http://dx.doi.org/10.1007/s11671-007-9051-y |
| Sumario: | The Wiener index of a graph G is defined as the sum of all distances between distinct vertices of G. In this paper an algorithm for constructing distance matrix of a zig-zag polyhex nanotube is introduced. As a consequence, the Wiener index of this nanotube is computed. |
|---|