Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,496,531 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
3 relations
Clique (graph theory)
Graph theory
Broader (1)
Graph operations
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Graphical model based continuous estimation of distribution algorithm
Latifeh PourMohammadBagher
,
M. Ebadzadeh
,
R. Safabakhsh
Applied Soft Computing
2017
Corpus ID: 1520456
Review
2015
Review
2015
New results on ptolemaic graphs
L. Markenzon
,
C. F. E. M. Waga
Discrete Applied Mathematics
2015
Corpus ID: 6216147
2013
2013
TwitterCrowds: Techniques for Exploring Topic and Sentiment in Microblogging Data
D. Archambault
,
Derek Greene
,
P. Cunningham
arXiv.org
2013
Corpus ID: 15423826
Analysts and social scientists in the humanities and industry require techniques to help visualize large quantities of…
Expand
2012
2012
Identifying Topical Twitter Communities via User List Aggregation
Derek Greene
,
D. O'Callaghan
,
P. Cunningham
arXiv.org
2012
Corpus ID: 2337814
A particular challenge in the area of social media analysis is how to find communities within a larger network of social…
Expand
2010
2010
Clique graph representations of ptolemaic graphs
T. McKee
Discussiones Mathematicae Graph Theory
2010
Corpus ID: 1106666
A graph is ptolemaic if and only if it is both chordal and distancehereditary. Thus, a ptolemaic graph G has two kinds of…
Expand
2009
2009
On expansive graphs
F. Larrión
,
V. Neumann-Lara
,
M. Pizaña
European journal of combinatorics (Print)
2009
Corpus ID: 14245082
2003
2003
SELF-CLIQUE GRAPHS WITH PRESCRIBED CLIQUE-SIZES
F. Larrión
,
V. Neumann-Lara
,
M. Pizaña
,
T. Porter
2003
Corpus ID: 18613024
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…
Expand
1998
1998
Iterated clique graphs with increasing diameters
C. Bornstein
,
J. Szwarcfiter
Journal of Graph Theory
1998
Corpus ID: 9224076
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…
Expand
1990
1990
The Hop eld-style Network as a Maximal-Clique Graph Machine
A. Jagota
1990
Corpus ID: 16176228
The Hop eld-style network, a variant of the popular Hop eld neural network, has earlier been shown to have xed points (stable…
Expand
1990
1990
Diameters of iterated clique graphs of chordal graphs
Bor-Liang Chen
,
Ko-Wei Lih
Journal of Graph Theory
1990
Corpus ID: 37476865
The clique graph K(G) of a graph is the intersection graph of maximal cliques of G. The iterated clique graph Kn(G) is…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE