On the Wiener polarity index of graphs

Hongbo Hua, Kinkar Ch Das

Research output: Contribution to journalArticlepeer-review

24 Scopus citations

Abstract

The Wiener polarity index Wp(G) of a graph G is the number of unordered pairs of vertices {u, v} in G such that the distance between u and v is equal to 3. Very recently, Zhang and Hu studied the Wiener polarity index in [Y. Zhang, Y. Hu, 2016] [38]. In this short paper, we establish an upper bound on the Wiener polarity index in terms of Hosoya index and characterize the corresponding extremal graphs. Moreover, we obtain Nordhaus-Gaddum-type results for Wp(G). Our lower bound on Wp(G)+Wp(G¯) is always better than the previous lower bound given by Zhang and Hu.

Original languageEnglish
Pages (from-to)162-167
Number of pages6
JournalApplied Mathematics and Computation
Volume280
DOIs
StatePublished - 20 Apr 2016

Keywords

  • Diameter
  • Hosoya index
  • Independence number
  • Nordhaus-Gaddum-type inequality
  • The Wiener polarity index
  • The Zagreb indices

Fingerprint

Dive into the research topics of 'On the Wiener polarity index of graphs'. Together they form a unique fingerprint.

Cite this