





Wiener Index of Trees with Given Number of Vertices of Even Degree Sequence
Subscribe/Renew Journal
The wiener index of a graph is the sum of the distances between all pairs of vertices. We characterize trees that achieve the maximum and minimum wiener index with given number of vertices of even degree.
User
Subscription
Login to verify subscription
Font Size
Information

Abstract Views: 270

PDF Views: 2