The Average Order of a Subtree of a Tree

Hua Wang

The Average Order of a Subtree of a Tree

Mathematical Sciences

Research output: Contribution to conference › Presentation

Abstract

Let T be a tree all of whose internal vertices have degree at least three. We show that the average order of a subtree of T is at least half the order of T, proving a conjecture raised by Jamison in 1983. It is also shown that the average order of a subtree of T is at most three quarters the order of T. Some open questions will be stated as well.

Original language	American English
State	Published - Oct 24 2008
Event	Fall Southeastern Sectional Meeting of the American Mathematical Society (AMS) - Boca Raton, FL Duration: Nov 1 2009 → …

Conference

Conference	Fall Southeastern Sectional Meeting of the American Mathematical Society (AMS)
Period	11/1/09 → …

Keywords

Average order
Subtree
Tree

DC Disciplines

Mathematics

Cite this

@conference{4fc64966fc0a46bc8231036d1b0485f1,

title = "The Average Order of a Subtree of a Tree",

abstract = " Let T be a tree all of whose internal vertices have degree at least three. We show that the average order of a subtree of T is at least half the order of T, proving a conjecture raised by Jamison in 1983. It is also shown that the average order of a subtree of T is at most three quarters the order of T. Some open questions will be stated as well.",

keywords = "Average order, Subtree, Tree",

author = "Hua Wang",

year = "2008",

month = oct,

day = "24",

language = "American English",

note = "Fall Southeastern Sectional Meeting of the American Mathematical Society (AMS) ; Conference date: 01-11-2009",

}

TY - CONF

T1 - The Average Order of a Subtree of a Tree

AU - Wang, Hua

PY - 2008/10/24

Y1 - 2008/10/24

N2 - Let T be a tree all of whose internal vertices have degree at least three. We show that the average order of a subtree of T is at least half the order of T, proving a conjecture raised by Jamison in 1983. It is also shown that the average order of a subtree of T is at most three quarters the order of T. Some open questions will be stated as well.

AB - Let T be a tree all of whose internal vertices have degree at least three. We show that the average order of a subtree of T is at least half the order of T, proving a conjecture raised by Jamison in 1983. It is also shown that the average order of a subtree of T is at most three quarters the order of T. Some open questions will be stated as well.

KW - Average order

KW - Subtree

KW - Tree

UR - http://www.ams.org/meetings/sectional/1044-05-151.pdf

M3 - Presentation

T2 - Fall Southeastern Sectional Meeting of the American Mathematical Society (AMS)

Y2 - 1 November 2009

ER -

The Average Order of a Subtree of a Tree

Abstract

Conference

Keywords

DC Disciplines

Other files and links

Fingerprint

Cite this