On the clique operator (Q3839009)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 1189244
Language Label Description Also known as
default for all languages
No label defined
    English
    On the clique operator
    scientific article; zbMATH DE number 1189244

      Statements

      0 references
      0 references
      8 October 1998
      0 references
      clique graph
      0 references
      Helly graphs
      0 references
      On the clique operator (English)
      0 references
      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].
      0 references

      Identifiers