INVESTIGADORES
BONOMO flavia
congresos y reuniones científicas
Título:
On weighted clique graphs
Autor/es:
BONOMO, FLAVIA; SZWARCFITER, JAYME
Lugar:
Itaipava
Reunión:
Workshop; Latin-American Workshop on Cliques in Graphs; 2010
Resumen:
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.