On weighted clique graphs

Let K(G) be the clique graph of a graph G. A m-weighting of K(G) consists on giving to each m-size subset of its vertices a weight equal to the size of the intersection of the m corresponding cliques of G. The 2-weighted clique graph was previously considered by McKee. In this work we obtain a chara...

Descripción completa

Detalles Bibliográficos
Autores principales: Bonomo, Flavia, Szwarcfiter, Jayme Luiz
Formato: Objeto de conferencia
Lenguaje:Inglés
Publicado: 2011
Materias:
Ciencias Informáticas
Weighted clique graphs
Graph classes structural characterization
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/139353
https://40jaiio.sadio.org.ar/sites/default/files/T2011/SIO/1151.pdf
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata
id I19-R120-10915-139353
record_format dspace
institution Universidad Nacional de La Plata
institution_str I-19
repository_str R-120
collection SEDICI (UNLP)
language Inglés
topic Ciencias Informáticas
Weighted clique graphs
Graph classes structural characterization
spellingShingle Ciencias Informáticas
Weighted clique graphs
Graph classes structural characterization
Bonomo, Flavia
Szwarcfiter, Jayme Luiz
On weighted clique graphs
topic_facet Ciencias Informáticas
Weighted clique graphs
Graph classes structural characterization
description Let K(G) be the clique graph of a graph G. A m-weighting of K(G) consists on giving to each m-size subset of its vertices a weight equal to the size of the intersection of the m corresponding cliques of G. The 2-weighted clique graph was previously considered by McKee. In this work we obtain a characterization of weighted clique graphs similar to Roberts and Spencer’s characterization for clique graphs. Some graph classes can be naturally defined in terms of their weighted clique graphs, for example clique-Helly graphs and their generalizations, and diamond-free graphs. The main contribution of this work is to characterize several graph classes by means of their weighted clique graph: hereditary clique-Helly graphs, split graphs, chordal graphs, UV graphs, interval graphs, proper interval graphs, trees, and block graphs.
format Objeto de conferencia
Objeto de conferencia
author Bonomo, Flavia
Szwarcfiter, Jayme Luiz
author_facet Bonomo, Flavia
Szwarcfiter, Jayme Luiz
author_sort Bonomo, Flavia
title On weighted clique graphs
title_short On weighted clique graphs
title_full On weighted clique graphs
title_fullStr On weighted clique graphs
title_full_unstemmed On weighted clique graphs
title_sort on weighted clique graphs
publishDate 2011
url http://sedici.unlp.edu.ar/handle/10915/139353
https://40jaiio.sadio.org.ar/sites/default/files/T2011/SIO/1151.pdf
work_keys_str_mv AT bonomoflavia onweightedcliquegraphs
AT szwarcfiterjaymeluiz onweightedcliquegraphs
bdutipo_str Repositorios
_version_ 1764820457569124354

Ejemplares similares