Computation of hosaya polynomial, wiener and hyper wiener index of jahangir graph j 6 , m

Abstract

Let G=(V,E)G=(V,E) be a simple connected graph with vertex set VV and edge set EE. For two vertices uu and vv in a graph GG, the distance d(u,v)d(u,v) is the shortest path between uu and vv in GG. Graph theory has much advancements in the field of theoretical chemistry. Recently, chemical graph theory is becoming very popular among researchers because of its wide applications of mathematics in chemistry. One of the important distance based topological index is the Wiener index, defined as the sum of distances between all pairs of vertices of GG, defined as W(G)=∑u,v∈V(G)d(u,v)W(G)=∑u,v∈V(G)d(u,v). The Hosaya polynomial is defined as H(G,x)=∑u,v∈V(G)xd(u,v)H(G,x)=∑u,v∈V(G)xd(u,v). The hyper Wiener index is defined as WW(G)=∑u,v∈V(G)d(u,v)+12∑u,v∈V(G)d2(u,v)WW(G)=∑u,v∈V(G)d(u,v)+12∑u,v∈V(G)d2(u,v). In this paper, we study and compute Hosaya polynomial, Wiener index and hyper Wiener index for Jahangir graph J6,mJ6,m, m≥3m≥3. Furthermore, we give exact values of these topological indices.