Name
Abstract | ||
|---|---|---|
Abstract The clique graph K(G) of a graph G is the intersection graph of the cliques of G. If G ≌ K(G) then G is a self-clique graph. We describe a sufficient condition for a graph to be self-clique. |
Year | DOI | Venue |
|---|---|---|
2001 | 10.1016/S1571-0653(04)00253-7 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
clique graph,clique-Helly graph,self-clique graph,2-self-clique graph | Block graph,Discrete mathematics,Combinatorics,Line graph,Graph power,Clique graph,Simplex graph,Mathematics,Intersection number (graph theory),Complement graph,Split graph | Journal |
Volume | ISSN | Citations |
7 | 1571-0653 | 4 |
PageRank | References | Authors |
0.58 | 1 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adrian Bondy | 1 | 33 | 4.71 |
| Guillermo Durén | 2 | 4 | 0.58 |
| Min Chih Lin | 3 | 259 | 21.22 |
| Jayme L. Szwarcfiter | 4 | 546 | 45.97 |