Skip to search formSkip to main contentSkip to account menu

Clique graph

In graph theory, a clique graph of an undirected graph G is another graph K(G) that represents the structure of cliques in G. Clique graphs were… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
A particular challenge in the area of social media analysis is how to find communities within a larger network of social… 
2010
2010
A graph is ptolemaic if and only if it is both chordal and distancehereditary. Thus, a ptolemaic graph G has two kinds of… 
2009
2009
2003
2003
The clique graph of a graph G is the intersection graph K(G) of the (maximal) cliques of G. A graph G is called self-clique… 
1998
1998
A simple argument by Hedman shows that the diameter of a clique graph G differs by at most one from that of K(G), its clique… 
1990
1990
The Hop eld-style network, a variant of the popular Hop eld neural network, has earlier been shown to have xed points (stable… 
1990
1990
The clique graph K(G) of a graph is the intersection graph of maximal cliques of G. The iterated clique graph Kn(G) is…