1.
J Nanosci Nanotechnol
; 11(10): 9032-8, 2011 Oct.
Artigo
em Inglês
| MEDLINE
| ID: mdl-22400297
RESUMO
The detour d(i, j) between vertices i and j of a graph is the number of edges of the longest path connecting these vertices. The matrix whose (i, j)-entry is the detour between vertices i and j is called the detour matrix. The half sum D of detours between all pairs of vertices (in a connected graph) is the detour index, i.e., D = (1/2) Sigma(j) Sigma(i) d(i, j). In this paper, we computed the detour index of TUHC6[2p, q] nanotubes for any p and q.