scientific article; zbMATH DE number 19202

MaRDI QIDQ3976632zbMATH OpenFDO

Authors Terry A. McKee

Publication date 26 June 1992

zbMATH Keywords

characterization theoremsclique graphclique multigraphline graph

Mathematics Subject Classification ID

Graph theory (05C99)

Review text

[For the entire collection see Zbl 0734.00014.] A graph \(C\) is a clique graph if there exist a simple graph \(G\) and a bijection of the cliques of \(G\) onto the set of vertices of \(C\) such that two vertices in \(C\) are adjacent iff the corresponding cliques of \(G\) have nonempty intersection. Analogously, a multigraph \(M\) is a clique multigraph if there exist a simple graph \(G\) and a bijection of the cliques of \(G\) onto the set of vertices of \(C\) such that the number of edges connecting two nodes of \(M\) equals the number of vertices in the intersection of the corresponding cliques of \(G\). The paper studies various aspects of the clique multigraphs and presents some characterization theorems, as e.g. full characterization of a simple graph to be a clique multigraph.

Recommendations

• On self-clique graphs with given clique sizes. II
• scientific article; zbMATH DE number 2096431
• On self-clique graphs all of whose cliques have equal size.
• A survey on clique graphs
• scientific article; zbMATH DE number 1750103

Cited in

(7)

• Edge-clique graphs
• Clique-gated graphs
• Characterization of classical graph classes by weighted clique graphs
• scientific article; zbMATH DE number 734470 (Why is no real title available?)
• Clique immersion in graph products
• Clique partitions of distance multigraphs
• Recognizing edge clique graphs among interval graphs and probe interval graphs

This page was built for publication:

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