Superdominance order and distance of trees

The distance of a tree is the sum of the distances between all pairs of vertices in the tree. This thesis deals with the problem of determining the trees having minimum and maximum distance within certain subclasses of trees of a fixed order. Using a new approach based on a weaker variant of the well-known dominance order on partitions, the optimal trees with bounded maximum degree and with a given degree sequence are characterized. Moreover, a natural weighted distance problem is solved.

Grantor dc:publisher

Publikationsserver der RWTH Aachen University

Year dc:date

2002

Author dc:creator

• Jelen, Frank

Contributors dc:contributor

• Triesch, Eberhard

• info:eu-repo/classification/ddc/004
• Informatik

Statement dc:rights

• info:eu-repo/semantics/openAccess

Language dc:language

eng

Identifier

https://publications.rwth-aachen.de/search?p=id:%22RWTH-CONV-114967%22

OAI record oai:identifier

https://publications.rwth-aachen.de/oai2d?verb=GetRecord&metadataPrefix=oai_dc&identifier=oai%3Apublications.rwth-aachen.de%3A52768