Largest Number of Subtrees of Trees with a Given Maximum Degree

Russell Kirk; Wang Hua

doi:10.1137/070687736

Largest Number of Subtrees of Trees with a Given Maximum Degree

Russell Kirk
, Wang Hua

Mathematical Sciences

University of Florida

Research output: Contribution to journal › Article › peer-review

39 Scopus citations

Abstract

We characterize trees, given a size and maximum vertex degree, which have the greatest number of subtrees. This generalizes the recent result of Szekely and Wang. These trees coincide with those which were shown by Fischermann et al., and independently Jelen and Triesch, to minimize the Wiener index.

Original language	American English
Journal	SIAM Journal on Discrete Mathematics
Volume	22
DOIs	https://doi.org/10.1137/070687736
State	Published - May 30 2008

Disciplines

Mathematics

Keywords

Maximum degree
Subtree
Tree
Wiener index

Access to Document

10.1137/070687736License: Unspecified

Cite this

@article{a8661b36d69f4a32a7259cb653aaeba3,

title = "Largest Number of Subtrees of Trees with a Given Maximum Degree",

abstract = " We characterize trees, given a size and maximum vertex degree, which have the greatest number of subtrees. This generalizes the recent result of Szekely and Wang. These trees coincide with those which were shown by Fischermann et al., and independently Jelen and Triesch, to minimize the Wiener index.",

keywords = "Maximum degree, Subtree, Tree, Wiener index",

author = "Russell Kirk and Wang Hua",

note = "In general, only the information that you provide, or the choices you make while visiting a web site, can be stored in a cookie. For example, the site cannot determine your email name unless you choose to type it.",

year = "2008",

month = may,

day = "30",

doi = "10.1137/070687736",

language = "American English",

volume = "22",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics Publications",

}

TY - JOUR

T1 - Largest Number of Subtrees of Trees with a Given Maximum Degree

AU - Kirk, Russell

AU - Hua, Wang

N1 - In general, only the information that you provide, or the choices you make while visiting a web site, can be stored in a cookie. For example, the site cannot determine your email name unless you choose to type it.

PY - 2008/5/30

Y1 - 2008/5/30

N2 - We characterize trees, given a size and maximum vertex degree, which have the greatest number of subtrees. This generalizes the recent result of Szekely and Wang. These trees coincide with those which were shown by Fischermann et al., and independently Jelen and Triesch, to minimize the Wiener index.

AB - We characterize trees, given a size and maximum vertex degree, which have the greatest number of subtrees. This generalizes the recent result of Szekely and Wang. These trees coincide with those which were shown by Fischermann et al., and independently Jelen and Triesch, to minimize the Wiener index.

KW - Maximum degree

KW - Subtree

KW - Tree

KW - Wiener index

UR - https://doi.org/10.1137/070687736

U2 - 10.1137/070687736

DO - 10.1137/070687736

M3 - Article

SN - 0895-4801

VL - 22

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

ER -

Largest Number of Subtrees of Trees with a Given Maximum Degree

Abstract

Disciplines

Keywords

Access to Document

Other files and links

Fingerprint

Cite this