Open Access Open Access  Restricted Access Subscription or Fee Access

Wiener Index of Trees with Given Number of Vertices of Even Degree Sequence

A. Vichithra

Abstract


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.


Full Text:

PDF

References


Z. Du and B. Zhou. Minimum Wiener indices of trees and unicyclic graphs of given matching number. MATCH Commun. Math. Comput. Chem., 63(1):101–112, 2010.

H. Lin. Extremal Wiener index of trees with given number of vertices of even degree. MATCH Commun. Math. Comput. Chem., 72(1):311–320, 2014.

H. Lin. A note on the maximal Wiener index of trees with given number of vertices of maximum degree. MATCH Commun. Math. Comput. Chem., 72(3):783–790, 2014

H. Wang. Corrigendum: The extremal values of the Wiener index of a tree with given degree sequence. Discrete Appl. Math., 157(18):3754, 2009.


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.