{
  "id": "1310.6208",
  "version": "v1",
  "published": "2013-10-23T12:51:25.000Z",
  "updated": "2013-10-23T12:51:25.000Z",
  "title": "Enumeration of one class of plane weighted trees",
  "authors": [
    "Yury Kochetkov"
  ],
  "comment": "10 pages, 5 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "By weighted tree we understand such connected tree,that: a) each its vertex and each edge have a positive integer weight; b) the weight of each vertex is equal to the sum of weights of outgoing edges. Each tree has a binary structure --- we can color its vertices in two colors, black and white so, that adjacent vertices have different colors. A type is a set of pairwise non-isotopic plane weighted trees with a given list of weights of white vertices and a given list of weights of black vertices. In this work we present a method for computing the cardinality of a given type.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2013-10-23T12:51:25.000Z"
    }
  ],
  "analyses": {
    "keywords": [
      "enumeration",
      "pairwise non-isotopic plane weighted trees",
      "positive integer weight",
      "adjacent vertices",
      "binary structure"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 10,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1310.6208K"
    }
  }
}