AL-Rafidain Journal of Computer Sciences and Mathematics

Abstract

Let G be a k₀-connected graph ,and let ,,be the w- width, distance between the two vertices  u,v  in G. The w-Wiener polynomial  of the width distance of G is defined by:
 
 
           
  
W_w(G;x) is obtained in this paper for  some special graphs G such as a cycle , a wheel, a theta graph , a straight hexagonal chain , and Wagner graph .The diameter with respect to the width distance – w, and the Wiener index for each such special graphs are also obtained in this paper.