Abstract. The Wiener type invariant W (λ) (G) of a simple connected graph G is defined as the sum of the terms d (u, v |G ) λ over all unordered pairs {u, v} of vertices of G, where d(u, v|G) denotes the distance between the vertices u and v in G and λ is an arbitrary real number. The cluster G 1 {G 2 } of a graph G 1 and a rooted graph G 2 is the graph obtained by taking one copy of G 1 and |V (G 1 )| copies of G 2 , and by identifying the root vertex of the i-th copy of G 2 with the i-th vertex of G 1 , for i = 1, 2, . . . , |V (G 1 )|. In this paper, we study the behavior of three versions of Wiener type invariant under the cluster product. Results are applied to compute several distance-based topological invariants of bristled and bridge graphs by specializing components in clusters.