Split Clique Graph Complexity

Abstract

A complete set of a graph G is a subset of vertices inducing a complete subgraph. A clique is a maximal complete set. Denote by ${ \mathcal{C}}(G)$ the clique family of G. The clique graph of G, denoted by K(G), is the intersection graph of ${\mathcal{C}}(G)$. Say that G is a clique graph if there exists a graph H such that G = K(H). The clique graph recognition problem, a long-standing open question posed in 1971, asks whether a given graph is a clique graph and it was recently proved to be NP-complete even for a graph G with maximum degree 14 and maximum clique size 12. Hence, if P≠NP, the study of graph classes where the problem can be proved to be polynomial, or of more restricted graph classes where the problem remains NP-complete is justified. We present a proof that given a split graph G = (V,E) with partition (K,S) for V, where K is a complete set and S is a stable set, deciding whether there is a graph H such that G is the clique graph of H is NP-complete. As a byproduct, we prove that a problem about the Helly property on a family of sets is NP-complete. Our result is optimum in the sense that each vertex of the independent set of our split instance has degree at most 3, whereas when each vertex of the independent set has degree at most 2 the problem is polynomial, since it is reduced to check whether the clique family of the graph satisfies the Helly property. Additionally, we show three split graph subclasses for which the problem is polynomially solvable: the subclass where each vertex of S has a private neighbor, the subclass where |S| ≤ 3, and the subclass where |K| ≤ 4.