Binary trees with the largest number of subtrees

L. A. Székely; Hua Wang

doi:10.1016/j.dam.2006.05.008

Binary trees with the largest number of subtrees

L. A. Székely, Hua Wang

Mathematical Sciences

University of South Carolina

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

46 Scopus citations

Abstract

This paper characterizes binary trees with n leaves, which have the greatest number of subtrees. These binary trees coincide with those which were shown by Fischermann et al. [Wiener index versus maximum degree in trees, Discrete Appl. Math. 122(1-3) (2002) 127-137] and Jelen and Triesch [Superdominance order and distance of trees with bounded maximum degree, Discrete Appl. Math. 125 (2-3) (2003) 225-233] to minimize the Wiener index.

Original language	English
Pages (from-to)	374-385
Number of pages	12
Journal	Discrete Applied Mathematics
Volume	155
Issue number	3
DOIs	https://doi.org/10.1016/j.dam.2006.05.008
State	Published - Feb 1 2007

Scopus Subject Areas

Discrete Mathematics and Combinatorics
Applied Mathematics

Keywords

Binary tree
Subtree
Wiener index

Access to Document

10.1016/j.dam.2006.05.008

Cite this

@article{7a63d7f9f8e1483cb7ea6ab234ed00d2,

title = "Binary trees with the largest number of subtrees",

abstract = "This paper characterizes binary trees with n leaves, which have the greatest number of subtrees. These binary trees coincide with those which were shown by Fischermann et al. [Wiener index versus maximum degree in trees, Discrete Appl. Math. 122(1-3) (2002) 127-137] and Jelen and Triesch [Superdominance order and distance of trees with bounded maximum degree, Discrete Appl. Math. 125 (2-3) (2003) 225-233] to minimize the Wiener index.",

keywords = "Binary tree, Subtree, Wiener index",

author = "Sz{\'e}kely, \{L. A.\} and Hua Wang",

year = "2007",

month = feb,

day = "1",

doi = "10.1016/j.dam.2006.05.008",

language = "English",

volume = "155",

pages = "374--385",

journal = "Discrete Applied Mathematics",

issn = "0166-218X",

publisher = "Elsevier B.V.",

number = "3",

}

TY - JOUR

T1 - Binary trees with the largest number of subtrees

AU - Székely, L. A.

AU - Wang, Hua

PY - 2007/2/1

Y1 - 2007/2/1

N2 - This paper characterizes binary trees with n leaves, which have the greatest number of subtrees. These binary trees coincide with those which were shown by Fischermann et al. [Wiener index versus maximum degree in trees, Discrete Appl. Math. 122(1-3) (2002) 127-137] and Jelen and Triesch [Superdominance order and distance of trees with bounded maximum degree, Discrete Appl. Math. 125 (2-3) (2003) 225-233] to minimize the Wiener index.

AB - This paper characterizes binary trees with n leaves, which have the greatest number of subtrees. These binary trees coincide with those which were shown by Fischermann et al. [Wiener index versus maximum degree in trees, Discrete Appl. Math. 122(1-3) (2002) 127-137] and Jelen and Triesch [Superdominance order and distance of trees with bounded maximum degree, Discrete Appl. Math. 125 (2-3) (2003) 225-233] to minimize the Wiener index.

KW - Binary tree

KW - Subtree

KW - Wiener index

UR - https://www.scopus.com/pages/publications/33751173389

U2 - 10.1016/j.dam.2006.05.008

DO - 10.1016/j.dam.2006.05.008

M3 - Article

SN - 0166-218X

VL - 155

SP - 374

EP - 385

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

IS - 3

ER -

Binary trees with the largest number of subtrees

Abstract

Scopus Subject Areas

Keywords

Access to Document

Other files and links

Fingerprint

Cite this