{
  "id": "1311.0706",
  "version": "v2",
  "published": "2013-11-04T14:06:06.000Z",
  "updated": "2014-03-25T06:56:07.000Z",
  "title": "Enumeration for the total number of all spanning forests of complete tripartite graph based on the combinatorial decomposition",
  "authors": [
    "Sung Sik U"
  ],
  "comment": "6 pages",
  "categories": [
    "math.CO"
  ],
  "abstract": "This paper discusses the enumeration for the total number of all rooted spanning forests of the labeled complete tripartite graph. We enumerate the total number by a combinatorial decomposition.",
  "revisions": [
    {
      "version": "v2",
      "updated": "2014-03-25T06:56:07.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C05",
      "05C17",
      "05C30"
    ],
    "keywords": [
      "total number",
      "combinatorial decomposition",
      "enumeration",
      "labeled complete tripartite graph",
      "paper discusses"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 6,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1311.0706U"
    }
  }
}