A sufficient condition for self-clique graphs
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.
Guardado en:
| Autores principales: | , , , |
|---|---|
| Formato: | JOUR |
| Materias: | |
| Acceso en línea: | http://hdl.handle.net/20.500.12110/paper_15710653_v7_n_p174_Bondy |
| Aporte de: |
| Sumario: | 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. |
|---|