{
  "id": "1703.07058",
  "version": "v1",
  "published": "2017-03-21T05:20:00.000Z",
  "updated": "2017-03-21T05:20:00.000Z",
  "title": "On Jacobian group and complexity of I-graph I(n,k,l) through Chebyshev polynomials",
  "authors": [
    "Ilya Mednykh"
  ],
  "comment": "17. arXiv admin note: substantial text overlap with arXiv:1612.03372",
  "categories": [
    "math.CO"
  ],
  "abstract": "We consider a family of I-graphs I(n,k,l), which is a generalization of the class of generalized Petersen graphs. In the present paper, we provide a new method for counting Jacobian group of the I-graph I(n,k,l). We show that the minimum number of generators of Jac(I(n,k,l)) is at least two and at most 2k + 2l - 1. Also, we obtain a closed formula for the number of spanning trees of I(n,k,l) in terms of Chebyshev polynomials. We investigate some arithmetical properties of this number and its asymptotic behaviour.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2017-03-21T05:20:00.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C30",
      "39A10"
    ],
    "keywords": [
      "chebyshev polynomials",
      "complexity",
      "counting jacobian group",
      "minimum number",
      "generalized petersen graphs"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}