{
  "id": "1405.6272",
  "version": "v1",
  "published": "2014-05-24T07:06:23.000Z",
  "updated": "2014-05-24T07:06:23.000Z",
  "title": "On the Number of Paths of length 5 in a Graph",
  "authors": [
    "Nazanin Movarraei"
  ],
  "comment": "22 pages, 62 figures",
  "categories": [
    "math.CO"
  ],
  "abstract": "In this paper, we obtain an explicit formula for the total number of paths of length 5 in a simple graph G. We also determine some formulae for the number of paths of length 5 each of which starts from an specific vertex $v_{i}$ and for the number of $v_{i}-v_{j}$ paths of length 5 in a simple graph G, in terms of the adjacency matrix and with the helps of combinatorics.",
  "revisions": [
    {
      "version": "v1",
      "updated": "2014-05-24T07:06:23.000Z"
    }
  ],
  "analyses": {
    "subjects": [
      "05C38"
    ],
    "keywords": [
      "simple graph",
      "total number",
      "explicit formula",
      "specific vertex",
      "adjacency matrix"
    ],
    "note": {
      "typesetting": "TeX",
      "pages": 22,
      "language": "en",
      "license": "arXiv",
      "status": "editable",
      "adsabs": "2014arXiv1405.6272M"
    }
  }
}