Simplex graph
Summary
In graph theory, a branch of mathematics, the simplex graph of an undirected graph is itself a graph, with one node for each clique (a set of mutually adjacent vertices) in . Two nodes of are linked by an edge whenever the corresponding two cliques differ in the presence or absence of a single vertex.
Further reading
- Wikipedia, page 20752774, revision 1317716493, Simplex graph. adopted
About this page
| Tag | NZSRWQX9GP |
|---|---|
| URI | m2://NZSRWQX9GP |
| Kind | concept |
| Writing | W1 stated |
| Same as | |
| Changed | 4 November 2026 |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge defines in: at least one definition (0 of 1)
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
- edge specializes both: the more general notions and the special cases (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.