Superdominance order and distance of trees with bounded maximum degree

Authors:
F. Jelen;E. Triesch
Affiliations:
Lehrstuhl II für Mathematik, RWTH Aachen, D-52056 Aachen, Germany;Lehrstuhl II für Mathematik, RWTH Aachen, D-52056 Aachen, Germany
Venue:
Discrete Applied Mathematics
Year:
2003

Citing 1
Cited 3

Wiener index versus maximum degree in trees

Discrete Applied Mathematics

Binary trees with the largest number of subtrees

Discrete Applied Mathematics
Wiener indices of balanced binary trees

Discrete Applied Mathematics
Wiener indices of balanced binary trees

ICCS'05 Proceedings of the 5th international conference on Computational Science - Volume Part II

Quantified Score

Hi-index	0.05

Visualization

Abstract

Using a weaker variant of the well-known dominance order on partitions, we determine the trees of fixed order and bounded maximum degree that have minimum distance.