A New Approach to Compute Wiener Index
Paul Manuel, Indra Rajasingh, Bharati Rajan, R. Sundara Rajan
Abstract
Paul Manuel, Indra Rajasingh, Bharati Rajan, R. Sundara Rajan
Abstract
Distance properties of molecular graphs form an important topic in chemical graph theory. The Wiener index of a graph G is defined as the sum of all distances between distinct vertices of G. A lot of research has been devoted to finding Wiener index by brute force method. In this paper we develop a method to compute the Wiener index of certain chemical graphs without using distance matrix.
OpenAlex reports 19 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Distance properties of molecular graphs form an important topic in chemical graph theory. The Wiener index of a graph G is defined as the sum of all distances between distinct vertices of G. A lot of research has been devoted to finding Wiener index by brute force method. In this paper we develop a method to compute the Wiener index of certain chemical graphs without using distance matrix.
Key concepts: Wiener index, Index (typography), Distance matrix, Topological index, Graph, Brute force, Mathematics, Combinatorics