Wiener indices of balanced binary trees

Authors:
Sergey Bereg;Hao Wang
Affiliations:
Dept. of Computer Science, University of Texas at Dallas, Richardson, TX;Dept. of Computer Science, University of Texas at Dallas, Richardson, TX
Venue:
ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II
Year:
2005

Citing 4
Cited 0

Algorithmic strategies in combinatorial chemistry

SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Wiener index versus maximum degree in trees

Discrete Applied Mathematics
Superdominance order and distance of trees with bounded maximum degree

Discrete Applied Mathematics
A Conjecture on Wiener Indices in Combinatorial Chemistry

Algorithmica

Quantified Score

Hi-index	0.00

Visualization

Abstract

We study a new family of trees for computation of the Wiener indices. We introduce general tree transformations and derive formulas for computing the Wiener indices when a tree is modified. We present several algorithms to explore the Wiener indices of our family of trees. The experiments support new conjectures about the Wiener indices.