Wiener Index and Subtrees of Binary Trees

Hua Wang

Wiener Index and Subtrees of Binary Trees

Mathematical Sciences

Research output: Contribution to conference › Presentation

Abstract

The Wiener index of a tree is the sum of all pairwise distances between vertices. It is one of the main descriptors that correlate a chemical compound’s molecular graph with experimentally gathered data regarding the compound’s characteristics. We characterize binary trees with n leaves, which have the greatest number of subtrees (or leaf-containing subtrees). These binary trees coincide with those which were shown by Fischermann et al. and Jelen and Triesch to minimize the Wiener index.

Original language	American English
State	Published - Apr 8 2005
Event	Spring Central Sectional Meeting of the American Mathematical Society (AMS) - Duration: Mar 13 2015 → …

Conference

Conference	Spring Central Sectional Meeting of the American Mathematical Society (AMS)
Period	03/13/15 → …

Disciplines

Mathematics

Keywords

Subtrees of binary trees
Wiener Index

Cite this

@conference{7f15d7ef848c4146bc6e3f62b448a31f,

title = "Wiener Index and Subtrees of Binary Trees",

abstract = " The Wiener index of a tree is the sum of all pairwise distances between vertices. It is one of the main descriptors that correlate a chemical compound{\textquoteright}s molecular graph with experimentally gathered data regarding the compound{\textquoteright}s characteristics. We characterize binary trees with n leaves, which have the greatest number of subtrees (or leaf-containing subtrees). These binary trees coincide with those which were shown by Fischermann et al. and Jelen and Triesch to minimize the Wiener index.",

keywords = "Subtrees of binary trees, Wiener Index",

author = "Hua Wang",

year = "2005",

month = apr,

day = "8",

language = "American English",

note = "Spring Central Sectional Meeting of the American Mathematical Society (AMS) ; Conference date: 13-03-2015",

}

TY - CONF

T1 - Wiener Index and Subtrees of Binary Trees

AU - Wang, Hua

PY - 2005/4/8

Y1 - 2005/4/8

N2 - The Wiener index of a tree is the sum of all pairwise distances between vertices. It is one of the main descriptors that correlate a chemical compound’s molecular graph with experimentally gathered data regarding the compound’s characteristics. We characterize binary trees with n leaves, which have the greatest number of subtrees (or leaf-containing subtrees). These binary trees coincide with those which were shown by Fischermann et al. and Jelen and Triesch to minimize the Wiener index.

AB - The Wiener index of a tree is the sum of all pairwise distances between vertices. It is one of the main descriptors that correlate a chemical compound’s molecular graph with experimentally gathered data regarding the compound’s characteristics. We characterize binary trees with n leaves, which have the greatest number of subtrees (or leaf-containing subtrees). These binary trees coincide with those which were shown by Fischermann et al. and Jelen and Triesch to minimize the Wiener index.

KW - Subtrees of binary trees

KW - Wiener Index

UR - http://www.ams.org/meetings/sectional/1006-05-5.pdf

M3 - Presentation

T2 - Spring Central Sectional Meeting of the American Mathematical Society (AMS)

Y2 - 13 March 2015

ER -

Wiener Index and Subtrees of Binary Trees

Abstract

Conference

Disciplines

Keywords

Other files and links

Fingerprint

Cite this