2012/09/03 by Xiumei Zhang, Zhang, Xiu-Mei, Xiao‐Dong Zhang +1
Computer Science · Mathematics · #05C35 #05C50 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Labeling and Dimension Problems #Graph theory and applications
paper · pdf · doi:10.48550/arxiv.1209.0273
openalex publication_date 2012/09/03 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 π=(d1, ..., d5, 1,..., 1) have been characterized.