ScholarLens Back to search
2009•Unpublished venueRequires access

Algorithm sa nd Extre mal Problem on Wiener Polarity Index

Wenxue Du, Xueliang Li, Yongtang Shi

Open publisher page 66 citations

Abstract

The Wiener polarity index WP (G) of a graph G =( V, E )i s the nu mber of unordered pairs of vertices {u, v} of G such that dG(u, v )= 3. In this paper, we consider the index for connected graphs. In the first part, we describe a linear time algorithm APT for computing the index of trees, and then characterize the trees maximizing the index among all trees of given order. In the second part, we present an algorithm which computes the index WP (G) for any

About this research paper

What this paper is about

The Wiener polarity index WP (G) of a graph G =( V, E )i s the nu mber of unordered pairs of vertices {u, v} of G such that dG(u, v )= 3. In this paper, we consider the index for connected graphs. In the first part, we describe a linear time algorithm APT for computing the index of trees, and then characterize the trees maximizing the index among all trees of given order. In the second part, we present an algorithm which computes the index WP (G) for any

Why it matters

OpenAlex reports 66 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

The Wiener polarity index WP (G) of a graph G =( V, E )i s the nu mber of unordered pairs of vertices {u, v} of G such that dG(u, v )= 3. In this paper, we consider the index for connected graphs. In the first part, we describe a linear time algorithm APT for computing the index of trees, and then characterize the trees maximizing the index among all trees of given order. In the second part, we present an algorithm which computes the index WP (G) for any

Key concepts: Combinatorics, Index (typography), Wiener index, Mathematics, Polarity (international relations), Connectivity, Graph, Topological index

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
Algorithm sa nd Extre mal Problem on Wiener Polarity Index — Research Paper | ScholarLens