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:

Detalles Bibliográficos
Autores principales:	Durán, Guillermo A., Lin, Min Chih
Publicado:	2000
Materias:	2-Self-clique graph Clique graph Clique-Helly graph Self-clique graph
Acceso en línea:	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v7_n_p174_Bondy http://hdl.handle.net/20.500.12110/paper_15710653_v7_n_p174_Bondy
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	paper:paper_15710653_v7_n_p174_Bondy
record_format	dspace
spelling	paper:paper_15710653_v7_n_p174_Bondy2025-07-30T19:00:09Z A sufficient condition for self-clique graphs Durán, Guillermo A. Lin, Min Chih 2-Self-clique graph Clique graph Clique-Helly graph Self-clique graph 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. Fil:Durán, G. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. Fil:Lin, M.C. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. 2000 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v7_n_p174_Bondy http://hdl.handle.net/20.500.12110/paper_15710653_v7_n_p174_Bondy
institution	Universidad de Buenos Aires
institution_str	I-28
repository_str	R-134
collection	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic	2-Self-clique graph Clique graph Clique-Helly graph Self-clique graph
spellingShingle	2-Self-clique graph Clique graph Clique-Helly graph Self-clique graph Durán, Guillermo A. Lin, Min Chih A sufficient condition for self-clique graphs
topic_facet	2-Self-clique graph Clique graph Clique-Helly graph Self-clique graph
description	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.
author	Durán, Guillermo A. Lin, Min Chih
author_facet	Durán, Guillermo A. Lin, Min Chih
author_sort	Durán, Guillermo A.
title	A sufficient condition for self-clique graphs
title_short	A sufficient condition for self-clique graphs
title_full	A sufficient condition for self-clique graphs
title_fullStr	A sufficient condition for self-clique graphs
title_full_unstemmed	A sufficient condition for self-clique graphs
title_sort	sufficient condition for self-clique graphs
publishDate	2000
url	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_15710653_v7_n_p174_Bondy http://hdl.handle.net/20.500.12110/paper_15710653_v7_n_p174_Bondy
work_keys_str_mv	AT duranguillermoa asufficientconditionforselfcliquegraphs AT linminchih asufficientconditionforselfcliquegraphs AT duranguillermoa sufficientconditionforselfcliquegraphs AT linminchih sufficientconditionforselfcliquegraphs
_version_	1840321721697042432

A sufficient condition for self-clique graphs

Ejemplares similares