| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 6872495 | Discrete Applied Mathematics | 2014 | 4 Pages |
Abstract
The Wiener index of a connected graph G is the sum of distances between all pairs of vertices of G. We characterize Eulerian graphs (with a fixed number of vertices) with smallest and greatest Wiener indices.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Ivan Gutman, Roberto Cruz, Juan Rada,