{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Example\n\nLet $n \\ge 1$ be an integer.\nThe path graph $P_n$ is the [[graph|0JD5C82QMB]] with vertex set $\\{0, 1, \\dots, n - 1\\}$ in which $i$ and $j$ are adjacent if and only if $|i - j| = 1$.\n\n## Remarks\n\n$P_n$ has $n$ vertices and $n - 1$ edges. It is a [[tree|0MJ0JS72DZ]], and for $n \\ge 2$ it has exactly two leaves, $0$ and $n - 1$.\nSome authors write $P_n$ for the path with $n$ edges, that is, with $n + 1$ vertices.\n\n## Explanations\n\n### L1 human\n\nA path graph is a row of vertices, each joined to the next.\nIt looks like beads on a string.\n",
  "commit": "6ac761d40018146541484a9e8b9eafd6ecc303dc",
  "front": {
    "instance_of": [
      "00C0BR7D7H"
    ],
    "kind": "example",
    "msc": [
      "05C38"
    ],
    "name": "Path graph",
    "same_as": {
      "wikidata": "Q917421",
      "wikipedia": "Path graph"
    },
    "sources": [
      {
        "locator": "lead section",
        "url": "https://en.wikipedia.org/wiki/Path_graph"
      }
    ],
    "tag": "075WR6W3Y3"
  },
  "kind": "example",
  "link": "https://math2.tamnd.com/node/075WR6W3Y3/",
  "links": [
    {
      "field": "instance_of",
      "target": "00C0BR7D7H"
    }
  ],
  "markdown": "https://math2.tamnd.com/node/075WR6W3Y3.md",
  "msc": [
    "05C38"
  ],
  "name": "Path graph",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/075/075WR6W3Y3.md",
  "status": null,
  "tag": "075WR6W3Y3",
  "uri": "m2://075WR6W3Y3",
  "url": "https://math2.tamnd.com/wiki/path-graph/",
  "writing": {
    "tag": "075WR6W3Y3",
    "kind": "example",
    "level": "W2",
    "next": [
      {
        "what": "a person confirmed each agent-written section",
        "note": "rule P04",
        "have": 0,
        "want": 1
      }
    ]
  }
}