On the clique operator

From MaRDI portal





Let \(k(G)\) be the clique graph of a graph \(G\) having as vertices all cliques of \(G\), with two cliques adjacent when they intersect. The authors study the image \(k({\mathcal G})\), where \({\mathcal G}\) denotes the class of all graphs, and the question whether \(k({\mathcal G})\) equals \(k^2({\mathcal G})\) or not. (For a characterization of \(k({\mathcal G})\) see also \textit{F. S. Roberts} and \textit{J. H. Spencer} [J. Comb. Theory, Ser. B 10, 102-108 (1971; Zbl 0215.05801)].) By investigating the structure of graphs in \(k({\mathcal G})\) that are not Helly graphs they show that there are two special subgraphs which have to be present in this situation, and prove that one of these subgraphs belongs also to \(k^2({\mathcal G})\). For the entire collection see [Zbl 0889.00032].











This page was built for publication: On the clique operator

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3839009)