Wiener indices of balanced binary trees

Authors:
Sergey Bereg;Hao Wang
Affiliations:
Department of Computer Science, University of Texas at Dallas, Box 830688, Richardson, TX 75083, USA;Computer Science and Information Systems Department, Kennesaw State University, 1000 Chastain Rd., Kennesaw, GA 30144-5591, USA
Venue:
Discrete Applied Mathematics
Year:
2007

Citing 4
Cited 1

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
On a conjecture on Wiener indices in combinatorial chemistry

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics

Nordhaus-Gaddum-type theorem for Wiener index of graphs when decomposing into three parts

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

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.