{
  "id": "1107.2171",
  "version": "v1",
  "published": "2011-07-12T00:24:34.000Z",
  "updated": "2011-07-12T00:24:34.000Z",
  "title": "Reverse degree distance of unicyclic graphs",
  "authors": [
    "Zhibin Du",
    "Bo Zhou"
  ],
  "categories": [
    "math.CO"
  ],
  "abstract": "The reverse degree distance is a connected graph invariant closely related to the degree distance proposed in mathematical chemistry. We determine the unicyclic graphs of given girth, number of pendant vertices and maximum degree, respectively, with maximum reverse degree distances.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2011-07-12T00:24:34.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C12",
      "05C35",
      "05C90"
    ],
    "keywords": [
      "unicyclic graphs",
      "graph invariant",
      "maximum reverse degree distances",
      "pendant vertices",
      "maximum degree"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 0,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2011arXiv1107.2171D"
    }
  }
}