Back to Search
Start Over
On the Wiener polarity index of graphs.
- Source :
-
Applied Mathematics & Computation . Apr2016, Vol. 280, p162-167. 6p. - Publication Year :
- 2016
-
Abstract
- The Wiener polarity index W p ( 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 W p ( G ). Our lower bound on W p ( G ) + W p ( G ¯ ) is always better than the previous lower bound given by Zhang and Hu. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISSN :
- 00963003
- Volume :
- 280
- Database :
- Academic Search Index
- Journal :
- Applied Mathematics & Computation
- Publication Type :
- Academic Journal
- Accession number :
- 113189224
- Full Text :
- https://doi.org/10.1016/j.amc.2016.01.043