Abstract
On the Wiener Polynomials of Some Trees
Highlights
Let G be a finite connected graph of vertex set V
Deriving a formula for the Wiener polynomial of some type of graphs requires that the graphs must have a particular degree of uniformity
In 1996, Sagan, Yeh and Zhang [6] obtained and studied Wiener polynomial for trees called "dendrimer" which are used in chemistry
Summary
Let G be a finite connected graph of vertex set V. The distance between vertices u and v in G is the length of a shortest u-v path. Let dG (u, v) , or d(u,v), denote the distance between vertices u and v. The eccentricity e(v) of a vertex v is the greatest possible distance from v to all other vertices of G, that is
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
