A WIENER INDEX FOR A CLASS OF GRAPHS USING PYTHON

Abstract

The Wiener number, widely used in chemical graph theory-molecular structure analysis; describes sum of shortest-path lengths (distances) between all pairs of vertices in a molecular Graph. H. Wiener developed it as topological measure to investigate the relationship between molecular structure and physical and chemical characteristics of certain hydrocarbon compounds. Traditional ways of computing the Wiener index are often time-consuming and prone to human error. In this paper we obtained Wiener number for a class of graphs Using python -network X, generated structures. For custom graph calculated the wiener number at each instance along with structures under ‘n’ number of modifications.