A sharp lower bound for the Wiener index of a graph

Details A sharp lower bound for the Wiener index of a graph A sharp lower bound for the Wiener index of a graph

2010-08-24

arxiv.org/abs/1008.4039v1

Ars Combinatoria,v.XCVII,Oct. 2010

Computer Science

Discrete Mathematics

Accepted for publication in Ars Combinatoria

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A sharp lower bound for the Wiener index of a graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A sharp lower bound for the Wiener index of a graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A sharp lower bound for the Wiener index of a graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-393879