A characterization of graphs \(G\) with \(G\cong K^ 2(G)\) (Q1916378)

Let \(G = G(V,E)\) be an undirected, connected, finite, simple graph. \(G\) is called a \(D\)-graph if for every set of cliques of \(G\) whose pairwise intersections are nonempty there is a vertex of \(G\) common to all cliques of the set. A \(D\)-graph \(G\) has the \(T_1\) property if for any two distinct vertices \(x\) and \(y\) of \(G\), there exist cliques \(C\) and \(D\) of \(G\) such that \(x \in C\) but \(y \notin C\), and \(y \in D\) but \(x \notin D\). In the present paper, in the class of \(D\)-graphs the graphs \(G\) with \(G \cong K^2 (G)\) are characterized, and the authors get the following main result: Let \(G\) be a \(D\)-graph. Then \(G \cong K^2 (G)\) iff \(G\) has the \(T_1\) property (Theorem 2.1). To prove this theorem many lemmas and additional theorems are necessary, and by the given examples it is easily seen that the condition that \(G\) is a \(D\)-graph cannot be dropped. By combining Theorem 2.1 and two other results the authors found equivalent conditions for \(D\)-graphs \(G\) to satisfy \(G \cong K^2 (G)\) (Theorem 2.11).