The minimal number of subtrees of a tree
type: Item
instance of: scholarly article
title: The minimal number of subtrees of a tree
zbMATH Open document ID: 1306.05030
author: Andrew V. Sills
author: Hua Wang
published in: Graphs and Combinatorics
publication date: 2015-01-20T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C07
Mathematics Subject Classification ID: 05C35
zbMATH DE Number: 6388178
zbMATH Keywords: subtrees
zbMATH Keywords: degree sequence
zbMATH Keywords: caterpillar
MaRDI profile type: Publication
full work available at URL: s00373-013-1376-y
OpenAlex ID: W2091297225
cites work: The Wiener maximum quadratic assignment problem
cites work: Wiener index of trees: Theory and applications
cites work: Wiener index versus maximum degree in trees
cites work: On \(\alpha \)-greedy expansions of numbers
cites work: Further analysis on the total number of subtrees of trees
cites work: Correlation of Graph‐Theoretical Indices
cites work: On the maximal Wiener index and related questions
cites work: On subtrees of trees
cites work: The extremal values of the Wiener index of a tree with given degree sequence
cites work: Q3643759
cites work: The Maximum Wiener Index of Trees with Given Degree Sequences
cites work: The Number of Subtrees of Trees with Given Degree Sequence
DOI: 10.1007/S00373-013-1376-Y
description: scientific article; zbMATH DE number 6388178