On self-clique graphs with given clique sizes, II |
| |
| Authors: | GL Chia Poh-Hwa Ong |
| |
| Institution: | a Institute of Mathematical Sciences, University of Malaya, 50603 Kuala Lumpur, Malaysia
b Department of Mathematical and Actuarial Sciences, Universiti Tunku Abdul Rahman, 46200 Petaling Jaya, Selangor, Malaysia |
| |
| Abstract: | 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 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: | Cliques in graphs Self-clique graphs |
| 本文献已被 ScienceDirect 等数据库收录！ |
|
