Trees with given degree sequences that have minimal subtrees

arXiv1209.0273MaRDI QIDQ6235397FDOQ6235397

Authors: Xiumei Zhang, Xiao-Dong Zhang 

Publication date: 3 September 2012

Abstract: In this paper, we investigate the structures of an extremal tree which has the minimal number of subtrees in the set of all trees with the given degree sequence of a tree. In particular, the extremal trees must be caterpillar and but in general not unique. Moreover, all extremal trees with a given degree sequence $pi=(d_1,\mathrm{...},d_5,1,\mathrm{...},1)$ have been characterized.

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35)

This page was built for publication: Trees with given degree sequences that have minimal subtrees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6235397)