No label defined (Q3976632)

[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.