{
  "id": "1304.7546",
  "version": "v1",
  "published": "2013-04-29T01:17:46.000Z",
  "updated": "2013-04-29T01:17:46.000Z",
  "title": "The Kirchhoff indices and the matching numbers of unicyclic graphs",
  "authors": [
    "Xuli Qi",
    "Bo Zhou",
    "Zhibin Du"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "The Kirchhoff index of a connected graph is the sum of resistance distances between all unordered pairs of vertices in the graph. It found considerable applications in a variety of fields. In this paper, we determine the minimum Kirchhoff index among the unicyclic graphs with fixed number of vertices and matching number, and characterize the extremal graphs.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2013-04-29T01:17:46.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C90",
      "05C12",
      "05C35"
    ],
    "keywords": [
      "unicyclic graphs",
      "matching number",
      "kirchhoff indices",
      "minimum kirchhoff index",
      "resistance distances"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2013arXiv1304.7546Q"
    }
  }
}