Abstract
If G is a connected graph, then the distance between two edges is, by definition, the distance between the corresponding vertices of the line graph of G. The edge-Wiener index We of G is then equal to the sum of distances between all pairs of edges of G. We give bounds on We in terms of order and size. In particular we prove the asymptotically sharp upper bound We (G) ≤ frac(25, 55) n5 + O (n9 / 2) for graphs of order n.
Original language | English |
---|---|
Pages (from-to) | 3452-3457 |
Number of pages | 6 |
Journal | Discrete Mathematics |
Volume | 309 |
Issue number | 10 |
DOIs | |
Publication status | Published - 28 May 2009 |
Externally published | Yes |
Keywords
- Distance
- Line graph
- Wiener index
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics