A sharp lower bound for the Wiener index of a graph
Discrete Mathematics
2010-12-13 v1 Combinatorics
Abstract
Given a simple connected undirected graph G, the Wiener index W(G) of G is defined as half the sum of the distances over all pairs of vertices of G. In practice, G corresponds to what is known as the molecular graph of an organic compound. We obtain a sharp lower bound for W(G) of an arbitrary graph in terms of the order, size and diameter of G.
Cite
@article{arxiv.1008.4039,
title = {A sharp lower bound for the Wiener index of a graph},
author = {R. Balakrishnan and N. Sridharan and K. V. Iyer},
journal= {arXiv preprint arXiv:1008.4039},
year = {2010}
}
Comments
Accepted for publication in Ars Combinatoria