{
  "id": "1209.0273",
  "version": "v1",
  "published": "2012-09-03T08:49:07.000Z",
  "updated": "2012-09-03T08:49:07.000Z",
  "title": "Trees with given degree sequences that have minimal subtrees",
  "authors": [
    "Xiu-Mei Zhang",
    "Xiao-Dong Zhang"
  ],
  "comment": "11 pages",
  "categories": [
    "math.CO"
  ],
  "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, ..., d_5, 1,..., 1)$ have been characterized.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2012-09-03T08:49:07.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C50",
      "05C35"
    ],
    "keywords": [
      "degree sequence",
      "minimal subtrees",
      "extremal tree",
      "minimal number"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 11,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2012arXiv1209.0273Z"
    }
  }
}