{
  "id": "1907.13481",
  "version": "v1",
  "published": "2019-07-30T05:42:55.000Z",
  "updated": "2019-07-30T05:42:55.000Z",
  "title": "Wiener index of graphs with fixed number of pendant or cut vertices",
  "authors": [
    "Dinesh Pandey",
    "Kamal Lochan Patra"
  ],
  "comment": "16 pages, 1 figure. arXiv admin note: text overlap with arXiv:1811.11411",
  "categories": [
    "math.CO"
  ],
  "abstract": "The Wiener index of a connected graph is defined as the sum of the distances between all unordered pair of its vertices. In this paper, we characterize the graphs which extremize the Wiener index among all graphs on $n$ vertices with $k$ pendant vertices. We also characterize the graph which minimizes the Wiener index over the graphs on $n$ vertices with $s$ cut vertices.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2019-07-30T05:42:55.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C05",
      "05C12",
      "05C35"
    ],
    "keywords": [
      "wiener index",
      "cut vertices",
      "fixed number",
      "pendant vertices"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 16,
      "language": "en",
      "license": "arXiv",
      "status": "editable"
    }
  }
}