Maximizing Distance in Trees

Hua Wang

Maximizing Distance in Trees

Mathematical Sciences

Research output: Contribution to conference › Presentation

Abstract

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.

Original language	American English
State	Published - Aug 25 2015
Event	Joint Austrian-Hungarian Mathematical Conference (AusHun) - Gyor, Hungary Duration: Aug 25 2015 → …

Conference

Conference	Joint Austrian-Hungarian Mathematical Conference (AusHun)
Period	08/25/15 → …

Keywords

Chemical graph tehory
Graph theory
Maximizing the sum of pairwise distances
Number theory
Trees

DC Disciplines

Mathematics

Cite this

@conference{de9da24d142b4e53846fa0de5366dd65,

title = "Maximizing Distance in Trees",

abstract = " 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. ",

keywords = "Chemical graph tehory, Graph theory, Maximizing the sum of pairwise distances, Number theory, Trees",

author = "Hua Wang",

year = "2015",

month = aug,

day = "25",

language = "American English",

note = "Joint Austrian-Hungarian Mathematical Conference (AusHun) ; Conference date: 25-08-2015",

}

TY - CONF

T1 - Maximizing Distance in Trees

AU - Wang, Hua

PY - 2015/8/25

Y1 - 2015/8/25

N2 - 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.

AB - 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.

KW - Chemical graph tehory

KW - Graph theory

KW - Maximizing the sum of pairwise distances

KW - Number theory

KW - Trees

UR - http://bolyai.hu/aushun15/aushun15_boa.pdf

M3 - Presentation

T2 - Joint Austrian-Hungarian Mathematical Conference (AusHun)

Y2 - 25 August 2015

ER -

Maximizing Distance in Trees

Abstract

Conference

Keywords

DC Disciplines

Other files and links

Fingerprint

Cite this