|
|
|
|
|
ABSTRACT:
The Padmakar-Ivan (PI) index of a graph G is defined as PI(G) = ‡”[neu(e|G)+ nev(e|G)], where neu(e|G) is the number of
edges of G lying closer to u than to v, nev(e|G) is the number of edges of G lying closer to v than to u and summation goes over all edges of G. In this paper, the PI index of a polyhex nanotorus T is computed. 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/239
|
|
|
|
|
|
|
| Prev |
Next |
|