Simplex graph
id:
simplex-graph-292-11496777
title:
Simplex graph
text:
In graph theory, a branch of mathematics, the simplex graph κ(G) of an undirected graph G is itself a graph, with one node for each clique in G. Two nodes of κ(G) are linked by an edge whenever the corresponding two cliques differ in the presence or absence of a single vertex. The empty set is included as one of the cliques of G that are used to form the clique graph, as is every set of one vertex and every set of two adjacent vertices. Therefore, the simplex graph contains within it a subdivisi
brand slug:
wiki
category slug:
encyclopedia
description:
Graph representing connectivity between cliques of another graph
original url:
https://en.wikipedia.org/wiki/Simplex_graph
date created:
date modified:
2023-06-20T18:08:29Z
main entity:
{"identifier":"Q7520883","url":"https://www.wikidata.org/entity/Q7520883"}
image:
{"content_url":"https://upload.wikimedia.org/wikipedia/commons/4/4c/Simplex_graph.svg","width":738,"height":432}
fields total:
13
integrity:
15