Title of article :
A sufficient condition for self-clique graphs
Author/Authors :
Bondy، نويسنده , , Adrian and Durén، نويسنده , , Guillermo and Lin، نويسنده , , Min Chih and Szwarcfiter، نويسنده , , Jayme L.، نويسنده ,
Issue Information :
روزنامه با شماره پیاپی سال 2001
Abstract :
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.
Keywords :
clique graph , clique-Helly graph , self-clique graph , 2-self-clique graph
Journal title :
Electronic Notes in Discrete Mathematics
Journal title :
Electronic Notes in Discrete Mathematics
