Characterizing simplex graphs

Yan-Ting Xie, Shou-Jun Xu

The simplex graph $S(G)$ of a graph $G$ is defined as the graph whose vertices are the cliques of $G$ (including the empty set), with two vertices being adjacent if, as cliques of…