{
  "id": "2409.02654",
  "version": "v1",
  "published": "2024-09-04T12:29:14.000Z",
  "updated": "2024-09-04T12:29:14.000Z",
  "title": "On the critical group of the k-partite graph",
  "authors": [
    "Xinyu Dong",
    "Guangfeng Jiang",
    "Weili Guo"
  ],
  "comment": "19 pages, 1 figure",
  "categories": [
    "math.CO"
  ],
  "abstract": "The critical group of a connected graph is closely related to the graph Laplacian, and is of high research value in combinatorics, algebraic geometry, statistical physics, and several other areas of mathematics. In this paper, we study the k-partite graphs and introduce an algorithm to get the structure of their critical groups by calculating the Smith normal forms of their graph Laplacians. When k is from 2 to 6, we characterize the structure of the critical groups completely, which can generalize the results of the complete bipartite graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2024-09-04T12:29:14.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C50",
      "20K01"
    ],
    "keywords": [
      "critical group",
      "k-partite graph",
      "graph laplacian",
      "complete bipartite graphs",
      "high research value"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 19,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}