{
  "id": "1612.03372",
  "version": "v1",
  "published": "2016-12-11T05:04:53.000Z",
  "updated": "2016-12-11T05:04:53.000Z",
  "title": "On Jacobian group and complexity of the generalized Petersen graph GP(n,k) through Chebyshev polynomials",
  "authors": [
    "Y. S. Kwon",
    "A. D. Mednykh",
    "I. A. Mednykh"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "In the present paper we find a simple algorithm for counting Jacobian group of the generalized Petersen graph GP(n,k). Also, we obtain a closed formula for the number of spanning trees of this graph in terms of Chebyshev polynomials.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2016-12-11T05:04:53.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C30",
      "39A10"
    ],
    "keywords": [
      "generalized petersen graph gp",
      "chebyshev polynomials",
      "complexity",
      "counting jacobian group",
      "simple algorithm"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}