Mathematical Sciences: Faculty Presentations (1991-2022)

Maximizing Distance in Trees

Document Type

Presentation

Presentation Date

8-25-2015

Copyright

This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.

Abstract or Description

We present a question, motivated from chemical graph theory, of maximizing the sum of pairwise distances. When restricted to trees with given degree sequence (a constraint of particular importance in applications), this question turned out to be very difficult. We will explore interesting observations and approaches from graph theory, number theory, and discrete optimization generated from this topic.

Sponsorship/Conference/Institution

Joint Austrian-Hungarian Mathematical Conference (AusHun)

Location

Gyor, Hungary

Link to Full Text

Share

COinS