{
  "aliases": [
    "bisimplicial-vertex"
  ],
  "backlinks": null,
  "body": "\n## Summary\n\nIn graph theory, a **simplicial vertex** $v$ is a vertex whose closed neighborhood $N_{G}[v]$ in a graph $G$ forms a [[clique|0BYX1D7C2E]], where every pair of neighbors is adjacent to each other.\n",
  "commit": "68a8c3dc73fd55004b2796431c607c30960d1a85",
  "front": {
    "aliases": [
      "bisimplicial-vertex"
    ],
    "inventory": [
      "WRDWZK2NWN"
    ],
    "kind": "concept",
    "name": "Simplicial vertex",
    "same_as": {
      "wikidata": "Q133850409",
      "wikipedia": "Simplicial vertex"
    },
    "sources": [
      {
        "locator": "Simplicial vertex",
        "mention": "wikipedia://en/79562353",
        "note": "adopted",
        "sections": [
          "Summary"
        ],
        "wikipedia": "en:79562353@r1318940295"
      }
    ],
    "tag": "PN8FCFRX7W"
  },
  "kind": "concept",
  "link": "https://math2.tamnd.com/node/PN8FCFRX7W/",
  "links": null,
  "markdown": "https://math2.tamnd.com/node/PN8FCFRX7W.md",
  "msc": null,
  "name": "Simplicial vertex",
  "prov": null,
  "role": "",
  "source": "https://github.com/tamnd/math2/blob/main/nodes/PN8/PN8FCFRX7W.md",
  "status": null,
  "tag": "PN8FCFRX7W",
  "uri": "m2://PN8FCFRX7W",
  "url": "https://math2.tamnd.com/wiki/simplicial-vertex/",
  "writing": {
    "tag": "PN8FCFRX7W",
    "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
      }
    ]
  }
}