Estimating the wiener index by means of number of vertices, number of edges, and diameter

Kinkar Ch Das, Ivan Gutman

Research output: Contribution to journalArticlepeer-review

34 Scopus citations

Abstract

Lower and upper bounds on the Wiener index of connected graphs and of triangle-and quadrangle-free graphs are obtained in terms of the number of vertices, number of edges, and diameter. In addition, Nordhaus-Gaddum-type results for the Wiener index are established.

Original languageEnglish
Pages (from-to)647-660
Number of pages14
JournalMatch
Volume64
Issue number3
StatePublished - 2010

Fingerprint

Dive into the research topics of 'Estimating the wiener index by means of number of vertices, number of edges, and diameter'. Together they form a unique fingerprint.

Cite this