Abstract
, be the w- width , Let G be a k0-connected graph, and let the distance between the two vertices u,v in G. The w-Wiener polynomial of the width distance of G is defined by:
The w-Wiener polynomials of the Cartesian product of K2with Complete graphKp, Star Sp, Complete bipartite graph Kr,s and path Pr , are obtained in this paper. The diameter with respect to the width distance-w, and the Wiener index for each such graphs are also obtained.
