The characterization of trees with the smaller Wiener polarity indices

Authors

  • Tang, Siping
  • Deng, Hanyuan

Abstract

The Wiener polarity index W P(G) of a graph G = (V, E) is the number of unordered pairs of vertices {u, v} of G such that the distance d G(u, v) between u and v is 3. In this paper, we characterize the trees with the second and third smallest Wiener polarity indices among all trees of order n and diameter k.

Published

2012-05-09

How to Cite

Tang, Siping, & Deng, Hanyuan. (2012). The characterization of trees with the smaller Wiener polarity indices. Utilitas Mathematica, 87. Retrieved from https://utilitasmathematica.com/index.php/Index/article/view/898

Issue

Section

Articles

Citation Check

Most read articles by the same author(s)

Obs.: This plugin requires at least one statistics/report plugin to be enabled. If your statistics plugins provide more than one metric then please also select a main metric on the admin's site settings page and/or on the journal manager's settings pages.