Twig Graph's Hyper Wiener Index Using C++

Abstract

Given a simple connected undirected graph G, the Wiener index W(G) of G is defined as half of the total sum of the distances overall pairs of vertices of G.   The Hyper Wiener HW(G) of G is defined as half of the square of the sum of the distances between overall pairs of vectors of G.  In this article, obtain theHyper Wiener index of K_n@(P_nʘK₁), K_n@T_n. _. Also write C++ programmes to find the Hyper Wiener index for the same graphs.