A sufficient condition for self-clique graphs

Mostrar todas las versiones(2)

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:	Bondy, A., Durán, G., Lin, M.C., Szwarcfiter, J.L.
Formato:	JOUR
Materias:	2-Self-clique graph Clique graph Clique-Helly graph Self-clique graph
Acceso en línea:	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	todo:paper_15710653_v7_n_p174_Bondy
record_format	dspace
spelling	todo:paper_15710653_v7_n_p174_Bondy2023-10-03T16:27:10Z A sufficient condition for self-clique graphs Bondy, A. Durán, G. Lin, M.C. Szwarcfiter, J.L. 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. JOUR info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by/2.5/ar 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 Bondy, A. Durán, G. Lin, M.C. Szwarcfiter, J.L. 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.
format	JOUR
author	Bondy, A. Durán, G. Lin, M.C. Szwarcfiter, J.L.
author_facet	Bondy, A. Durán, G. Lin, M.C. Szwarcfiter, J.L.
author_sort	Bondy, 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
url	http://hdl.handle.net/20.500.12110/paper_15710653_v7_n_p174_Bondy
work_keys_str_mv	AT bondya asufficientconditionforselfcliquegraphs AT durang asufficientconditionforselfcliquegraphs AT linmc asufficientconditionforselfcliquegraphs AT szwarcfiterjl asufficientconditionforselfcliquegraphs AT bondya sufficientconditionforselfcliquegraphs AT durang sufficientconditionforselfcliquegraphs AT linmc sufficientconditionforselfcliquegraphs AT szwarcfiterjl sufficientconditionforselfcliquegraphs
_version_	1807321118807162880

A sufficient condition for self-clique graphs

Ejemplares similares