Alireza Mohammadian Pourtalari - Department of Physics, Sofian branch, Islamic Azad University, East Azarbaijan, Iran,
Yaser Alizadeh - ۲Department of Mathematics, Tarbiat Modares University, Tehran, Iran
Mohammad Ilmakchi - ۳Department of Mathematics, Shahid Madani University, Tabriz, Iran

The Wiener index of a graph G is defined as{ , } ( )( , )21( )i j V GW G d i j , where V(G) is the set of verticesof G an d(i, j) is the distance between vertices i and j . In this paper, we give an algorithm forcomputing distances in a simple connected graph; also by GAP program, we compute the Wienerindex for 5 7SC C [p,q] nanotubes

رNanotube, Wiener Index, Algorithm, Graph, GAP Program