{
  "id": "1308.2281",
  "version": "v1",
  "published": "2013-08-10T06:42:15.000Z",
  "updated": "2013-08-10T06:42:15.000Z",
  "title": "On the determinant of the distance matrix of a bicyclic graph",
  "authors": [
    "Shi-Cai Gong",
    "Ju-Li Zhang",
    "Guang-Hui Xu"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "Two cycles are referred as disjoint if they have no common edges. In this paper, we will investigate the determinant of the distance matrix of a graph, giving a formula for the determinant of the distance matrix of a bicyclic graph whose two cycles are disjoint, which extends the formula for the determinant of the distance matrix of a tree, as well as that of a unicyclic graph.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2013-08-10T06:42:15.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C50",
      "15A18"
    ],
    "keywords": [
      "distance matrix",
      "bicyclic graph",
      "determinant",
      "unicyclic graph"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}