---
tag: NZSRWQX9GP
kind: concept
name: Simplex graph
sources:
  - wikipedia: en:20752774@r1317716493
    locator: Simplex graph
    note: adopted
    mention: wikipedia://en/20752774
    sections: [Summary]
same_as:
  wikidata: Q7520883
  wikipedia: Simplex graph
inventory: [JG5R5JW3M8]
---

## Summary

In graph theory, a branch of mathematics, the **simplex graph** $\kappa(G)$ of an undirected graph $G$ is itself a graph, with one node for each [[clique|0BYX1D7C2E]] (a set of mutually adjacent vertices) in $G$. Two nodes of $\kappa(G)$ are linked by an edge whenever the corresponding two cliques differ in the presence or absence of a single vertex.