PDF

Keywords

Wiener Polynomials
Width Distance
compound graphs

Abstract

For a connected vertex disjoint graphs G1 and G2 , we define G1 ☒ G2 as the graph obtained from the union of G1 and G2 with four edges joining  the vertices of an edge of G1 to the vertices of an edge of G2 .In this paper we obtain Wiener polynomials of the width distance-2 for Ks ☒ Kt   ,   Ks ☒ Gt and    Gs ☒ Gt.The Wiener index of each such composite graph is also obtained.   
https://doi.org/10.33899/csmj.2010.163895
  PDF