مشخصات پژوهش

The Wiener index of a graph G is defined as Σ⊆ = { , } ( ) ( , ) 2 ( ) 1 i j V G W G d i j , where V (G) is the set of vertices of G and d(i, j) is the distance between vertices i and j . In this paper, we give an algorithm for computing distances in a simple connected graph; also by GAP program, we compute the Wiener index for SC5C7[p,q] nanotubes