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 language | English |
|---|---|
| Pages (from-to) | 647-660 |
| Number of pages | 14 |
| Journal | Match |
| Volume | 64 |
| Issue number | 3 |
| State | Published - 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
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver