ABSTRACT
The tensor product of graphs is a very well-known graph product. One of the important concepts related to distance is the Wiener index. The Wiener index has many applications in various fields, e.g., cryptography, chemistry etc. This chapter obtains the Wiener index for any connected, bipartite graph with diameter at most 4. It also obtains the Wiener index for some non-bipartite graphs such as the wheel graph and Helm graph. The chapter discusses the Wiener index of the tensor product of a cycle graph and any bipartite graph with a specific diameter. The wheel graph is provided with a set of vertices and a center vertex is adjacent to every vertex. The helm graph is obtained by adding a pendent vertex to each vertex. The closed helm graph is obtained by adding edges between pendent vertices, and a flower graph is obtained by joining each pendent vertex to the center vertex.
