Characterization of classical graph classes by weighted clique graphs

Given integers m1,.,mℓ, the weighted clique graph of G is the clique graph K(G), in which there is a weight assigned to each complete set S of size mi of K(G), for each i=1,.,ℓ. This weight equals the cardinality of the intersection of the cliques of G corresponding to S. We characterize weighted cl...

Descripción completa

Guardado en:

Detalles Bibliográficos
Autor principal:	Bonomo, Flavia
Publicado:	2014
Materias:	Graph classes structural characterization Weighted clique graphs Characterization Graph theory Cardinalities Chordal graphs Clique graphs Graph class Interval graph Proper interval graphs Split graphs Structural characterization Graphic methods
Acceso en línea:	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0166218X_v165_n_p83_Bonomo http://hdl.handle.net/20.500.12110/paper_0166218X_v165_n_p83_Bonomo
Aporte de:	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA) de Universidad de Buenos Aires

id	paper:paper_0166218X_v165_n_p83_Bonomo
record_format	dspace
spelling	paper:paper_0166218X_v165_n_p83_Bonomo2023-06-08T15:15:33Z Characterization of classical graph classes by weighted clique graphs Bonomo, Flavia Graph classes structural characterization Weighted clique graphs Characterization Graph theory Cardinalities Chordal graphs Clique graphs Graph class Interval graph Proper interval graphs Split graphs Structural characterization Graphic methods Given integers m1,.,mℓ, the weighted clique graph of G is the clique graph K(G), in which there is a weight assigned to each complete set S of size mi of K(G), for each i=1,.,ℓ. This weight equals the cardinality of the intersection of the cliques of G corresponding to S. We characterize weighted clique graphs in similar terms as Roberts and Spencer's characterization of clique graphs. Further we characterize several classical graph classes in terms of their weighted clique graphs, providing a common framework for describing some different well-known classes of graphs, as hereditary clique-Helly graphs, split graphs, chordal graphs, interval graphs, proper interval graphs, line graphs, among others. © 2013 Elsevier B.V. All rights reserved. Fil:Bonomo, F. Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales; Argentina. 2014 https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0166218X_v165_n_p83_Bonomo http://hdl.handle.net/20.500.12110/paper_0166218X_v165_n_p83_Bonomo
institution	Universidad de Buenos Aires
institution_str	I-28
repository_str	R-134
collection	Biblioteca Digital - Facultad de Ciencias Exactas y Naturales (UBA)
topic	Graph classes structural characterization Weighted clique graphs Characterization Graph theory Cardinalities Chordal graphs Clique graphs Graph class Interval graph Proper interval graphs Split graphs Structural characterization Graphic methods
spellingShingle	Graph classes structural characterization Weighted clique graphs Characterization Graph theory Cardinalities Chordal graphs Clique graphs Graph class Interval graph Proper interval graphs Split graphs Structural characterization Graphic methods Bonomo, Flavia Characterization of classical graph classes by weighted clique graphs
topic_facet	Graph classes structural characterization Weighted clique graphs Characterization Graph theory Cardinalities Chordal graphs Clique graphs Graph class Interval graph Proper interval graphs Split graphs Structural characterization Graphic methods
description	Given integers m1,.,mℓ, the weighted clique graph of G is the clique graph K(G), in which there is a weight assigned to each complete set S of size mi of K(G), for each i=1,.,ℓ. This weight equals the cardinality of the intersection of the cliques of G corresponding to S. We characterize weighted clique graphs in similar terms as Roberts and Spencer's characterization of clique graphs. Further we characterize several classical graph classes in terms of their weighted clique graphs, providing a common framework for describing some different well-known classes of graphs, as hereditary clique-Helly graphs, split graphs, chordal graphs, interval graphs, proper interval graphs, line graphs, among others. © 2013 Elsevier B.V. All rights reserved.
author	Bonomo, Flavia
author_facet	Bonomo, Flavia
author_sort	Bonomo, Flavia
title	Characterization of classical graph classes by weighted clique graphs
title_short	Characterization of classical graph classes by weighted clique graphs
title_full	Characterization of classical graph classes by weighted clique graphs
title_fullStr	Characterization of classical graph classes by weighted clique graphs
title_full_unstemmed	Characterization of classical graph classes by weighted clique graphs
title_sort	characterization of classical graph classes by weighted clique graphs
publishDate	2014
url	https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0166218X_v165_n_p83_Bonomo http://hdl.handle.net/20.500.12110/paper_0166218X_v165_n_p83_Bonomo
work_keys_str_mv	AT bonomoflavia characterizationofclassicalgraphclassesbyweightedcliquegraphs
_version_	1768544906044768256

Characterization of classical graph classes by weighted clique graphs

Ejemplares similares