On self-clique graphs / Ong Poh Hwa
The clique graph of a graph G is the graph obtained by taking the cliques of G as vertices, and two vertices are adjacent if and only if the corresponding cliques have non-empty intersection. A graph G is self-clique if it is isomorphic to its clique graph. Clique graphs have been studied for some t...
| Auteur principal: | |
|---|---|
| Format: | Thèse |
| Publié: |
2010
|
| Sujets: |