ScholarLens Back to search
2011•Unpublished venueRequires access

On the Wiener Polarity Index

Muhuo Liu, Bo Liu

Open publisher page 22 citations

Abstract

The Wiener polarity index WP (G) of a graph G is the number of unordered pairs of vertices {u, v} of G such that the distance of u and v is equal to 3. In this paper, we obtain the relation between Wiener polarity index and Zegreb indices, and the relation between Wiener polarity index and Wiener index (resp. hyper-Wiener index). Moreover, we determine the second smallest Wiener polarity index together with the corresponding graphs among all trees on n vertices, we also identify the smallest and the second smallest Wiener polarity indices together with the corresponding graphs, respectively, among all unicyclic graphs on n vertices.

About this research paper

What this paper is about

The Wiener polarity index WP (G) of a graph G is the number of unordered pairs of vertices {u, v} of G such that the distance of u and v is equal to 3. In this paper, we obtain the relation between Wiener polarity index and Zegreb indices, and the relation between Wiener polarity index and Wiener index (resp. hyper-Wiener index). Moreover, we determine the second smallest Wiener polarity index together with the corresponding graphs among all trees on n vertices, we also identify the smallest and the second smallest Wiener polarity indices together with the corresponding graphs, respectively, among all unicyclic graphs on n vertices.

Why it matters

OpenAlex reports 22 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 is the number of unordered pairs of vertices {u, v} of G such that the distance of u and v is equal to 3. In this paper, we obtain the relation between Wiener polarity index and Zegreb indices, and the relation between Wiener polarity index and Wiener index (resp. hyper-Wiener index). Moreover, we determine the second smallest Wiener polarity index together with the corresponding graphs among all trees on n vertices, we also identify the smallest and the second smallest Wiener polarity indices together with the corresponding graphs, respectively, among all unicyclic graphs on n vertices.

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

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
On the Wiener Polarity Index — Research Paper | ScholarLens