A class of clique-closed graphs (Q1322222): Difference between revisions

A family \(F\) of graphs is clique-closed, if the clique graph of any graph in \(F\) is again in \(F\), and any graph in the family \(F\) is the clique graph of some graph in \(F\). Consider the family \(F\) of all finite connected graphs \(G\) having the following two properties: (1) Every set of cliques of \(G\), no two of which are disjoint, has nonempty total intersection. (2) For any two distinct vertices \(x\) and \(y\), there exist cliques \(C\) and \(D\) such that \(x\) is in \(C-D\) and \(y\) is in \(D-C\). The authors prove that the family \(F\) is clique-closed.