A survey on clique graphs (Q4407448)

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 1944140
Language Label Description Also known as
default for all languages
No label defined
    English
    A survey on clique graphs
    scientific article; zbMATH DE number 1944140

      Statements

      7 January 2004
      0 references
      clique graphs
      0 references
      A survey on clique graphs (English)
      0 references
      Clique graphs are very well-investigated special intersection graphs. The clique graph \(K(G)\) of a graph \(G\) is defined to be the intersection graph of the set of all cliques of \(G\), meaning it has a vertex for each such clique, and different vertices are adjacent in \(K(G)\) if the corresponding cliques have at least one vertex in common. Note that in this context, a clique always denotes an inclusion-maximal complete subgraph. The paper gives a survey over most parts of the literature of clique graphs. The characterization problem is discussed first, followed by the questions of characterizing clique graphs of graphs in certain special classes, or characterizing graphs whose clique graphs are in such a special class. Although no ``good'' characterization of clique graphs is known yet, there are a number of results for the other two questions available, for a variety of graph classes. Questions concerning iterated clique graphs are discussed next, questions about how eventually the iterated clique graph of a graph looks like, and about the diameter of iterated clique graphs. The paper contains many proofs of results, and ends with a list of 13 open problems. For the entire collection see [Zbl 1005.00014].
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references