| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4650054 | Discrete Mathematics | 2009 | 10 Pages |
Abstract
The clique graph of a graph GG is the graph obtained by taking the cliques of GG as vertices, and two vertices are adjacent if and only if the corresponding cliques have a non-empty intersection. A graph is self-clique if it is isomorphic to its clique graph. We give a new characterization of the set of all connected self-clique graphs having all cliques but two of size 2.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
G.L. Chia, Poh-Hwa Ong,