{
  "aliases": null,
  "backlinks": null,
  "body": "\n## Summary\n\nIn crystallography and graph theory, the **coordination sequence** of a vertex $v$ is an integer sequence that counts how many vertices are at each possible [[distance|0QV9VNNB4Z]] from $v$. That is, it is a sequence\n\n$$n_0, n_1, n_2,\\dots$$\n\nwhere each $n_i$ is the number of vertices that are $i$ steps away from $v$. If the graph is vertex-transitive, then the sequence is an invariant of the graph that does not depend on the specific choice of $v$. Coordination sequences can also be defined for sphere packings, by using either the contact graph of the spheres or the Delaunay triangulation of their centers, but these two choices may give rise to different sequences.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "inventory": [
      "2JM6MHSTR3"
    ],
    "kind": "concept",
    "name": "Coordination sequence",
    "same_as": {
      "wikidata": "Q107394824",
      "wikipedia": "Coordination sequence"
    },
    "sources": [
      {
        "locator": "Coordination sequence",
        "mention": "wikipedia://en/67980941",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:67980941@r1376023393"
      }
    ],
    "tag": "CWPRX0R5ET"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/CWPRX0R5ET/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/CWPRX0R5ET.md",
  "msc": null,
  "name": "Coordination sequence",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/CWP/CWPRX0R5ET.md",
  "status": null,
  "tag": "CWPRX0R5ET",
  "uri": "m2://CWPRX0R5ET",
  "url": "https://math2.tamnd.com/wiki/coordination-sequence/",
  "writing": {
    "tag": "CWPRX0R5ET",
    "kind": "concept",
    "level": "W1",
    "next": [
      {
        "what": "edge defines in",
        "note": "at least one definition",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge instance_of in",
        "note": "at least two examples",
        "have": 0,
        "want": 2
      },
      {
        "what": "edge not_instance_of in",
        "note": "at least one non-example",
        "have": 0,
        "want": 1
      },
      {
        "what": "edge specializes both",
        "note": "the more general notions and the special cases",
        "have": 0,
        "want": 1
      }
    ]
  }
}