Given a simple connected undirected tree T, the Wiener index W(T) of T is defined as half the sum of the distances of all pairs of vertices of T. In practice, T corresponds to what is known as the molecular graph of an organic compound. We obtain the Wiener Lower Sum WL(T) and Wiener Upper Sum WU(L) of an arbitrary - tree.
9654467111 Call Girls In Raj Nagar Delhi Short 1500 Night 6000
Wiener Upper and Lower Sum of - Tree
1. International Journal of Computing Algorithm, Vol 1(2), December 2012
ISSN(Print):2278-2397
Website: www.ijcoa.com
Wiener Upper and Lower Sum of
r
nP - Tree
S.Rubanraj1
, P.Rajkumar2
1
Department of Mathematics, St. Joseph’s College (Autonomous), Trichy, Tamilnadu, India
2
Department of Mathematics, Srimad Andavan Arts and Science College, T.V. Koil, Trichy.
E-mail: ruban946@gmail.com, journalrajkumar@gmail.com
Abstract
Given a simple connected undirected tree T, the Wiener index W (T) of T is defined as half
the sum of the distances of all pairs of vertices of T. In practice, T corresponds to what is
known as the molecular graph of an organic compound. We obtain the Wiener Lower Sum
WL(T) and Wiener Upper Sum WU(L) of an arbitrary
r
nP
- tree