The icosahedron is clique divergent (Q1868854)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The icosahedron is clique divergent |
scientific article |
Statements
The icosahedron is clique divergent (English)
0 references
28 April 2003
0 references
A clique of a graph is a maximal complete subgraph. The clique graph \(k(G)\) is the intersection graph of all cliques of \(G\). The iterated clique graph \(k^n(G)\) is the result of repeatedly applying the clique graph operator to \(G\) for \(n\) times. A graph \(G\) is said to be clique divergent if the number of vertices of \(k^n(G)\) approaches infinity as \(n\) goes to infinity. This paper proves the clique divergence of the icosahedron.
0 references
clique graph
0 references
clique divergence
0 references
icosahedron
0 references