An exact expression for the Wiener index of a polyhex nanotorus
|
 |
|
Post a Comment
|
 |
|
|
|
|
ABSTRACT:
The Wiener index of a graph G is defined as W(G) = 1/2‡” [x,y]V (G)d(x,y), where V(G) is the set of all vertices of G and for x,y V(G), d(x,y) denotes the length of a minimal path between x and y. In this paper an algorithm for computing the distance matrix of a polyhex nanotorus T = T[p,q] is given. Using this matrix, we obtain an exact expression for the Wiener index of T.
We prove that: (Equation presented).
|
|
|
|
STATISTICS
|
|
Click on # to view
|
|
Citations
|
|
0
|
|
References
|
|
1
|
|
Comments
|
|
0
|
|
Quality
|
|
0/0.00
|
|
Interest
|
|
0/0.00
|
|
View(er)s
|
|
1/236
|
|
|
|
|
|
|
| Prev |
Next |
|