On weighted clique graphs

Autores
Bonomo, Flavia; Szwarcfiter, Jayme L.
Año de publicación
2010
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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.
Fil: Bonomo, Flavia. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigaciones Matemáticas "Luis A. Santaló". Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigaciones Matemáticas "Luis A. Santaló"; Argentina
Fil: Szwarcfiter, Jayme L.. Universidade Federal do Rio de Janeiro; Brasil
4th Latin-American Workshop on Cliques in Graphs
Itaipava
Brasil
Sociedade Brasileira de Matemática
Materia
WEIGHTED CLIQUE GRAPHS
GRAPH CLASSES STRUCTURAL CHARACTERIZATION
Nivel de accesibilidad
acceso abierto
Condiciones de uso
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
Repositorio
CONICET Digital (CONICET)
Institución
Consejo Nacional de Investigaciones Científicas y Técnicas
OAI Identificador
oai:ri.conicet.gov.ar:11336/282050
Acceder
id CONICETDig_27790e870445bfaf0b86e4764edeac53
oai_identifier_str oai:ri.conicet.gov.ar:11336/282050
network_acronym_str CONICETDig
repository_id_str 3498
network_name_str CONICET Digital (CONICET)
spelling On weighted clique graphsBonomo, FlaviaSzwarcfiter, Jayme L.WEIGHTED CLIQUE GRAPHSGRAPH CLASSES STRUCTURAL CHARACTERIZATIONhttps://purl.org/becyt/ford/1.1https://purl.org/becyt/ford/1https://purl.org/becyt/ford/1.2https://purl.org/becyt/ford/1Let 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.Fil: Bonomo, Flavia. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigaciones Matemáticas "Luis A. Santaló". Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigaciones Matemáticas "Luis A. Santaló"; ArgentinaFil: Szwarcfiter, Jayme L.. Universidade Federal do Rio de Janeiro; Brasil4th Latin-American Workshop on Cliques in GraphsItaipavaBrasilSociedade Brasileira de MatemáticaSociedade Brasileira de Matemática2010info:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/conferenceObjectWorkshopJournalhttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdfapplication/pdfapplication/pdfhttp://hdl.handle.net/11336/282050On weighted clique graphs; 4th Latin-American Workshop on Cliques in Graphs; Itaipava; Brasil; 2010; 9-222317-6636CONICET DigitalCONICETenginfo:eu-repo/semantics/altIdentifier/url/https://mc.sbm.org.br/volumes/volume-39/info:eu-repo/semantics/altIdentifier/doi/10.21711/231766362010/rmc392info:eu-repo/semantics/altIdentifier/url/https://mc.sbm.org.br/wp-content/uploads/sites/15/2021/08/39-2.pdfInternacionalinfo:eu-repo/semantics/openAccesshttps://creativecommons.org/licenses/by-nc-sa/2.5/ar/reponame:CONICET Digital (CONICET)instname:Consejo Nacional de Investigaciones Científicas y Técnicas2026-03-31T15:17:37Zoai:ri.conicet.gov.ar:11336/282050instacron:CONICETInstitucionalhttp://ri.conicet.gov.ar/Organismo científico-tecnológicoNo correspondehttp://ri.conicet.gov.ar/oai/requestdasensio@conicet.gov.ar; lcarlino@conicet.gov.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:34982026-03-31 15:17:37.668CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicasfalse
dc.title.none.fl_str_mv On weighted clique graphs
title On weighted clique graphs
spellingShingle On weighted clique graphs
Bonomo, Flavia
WEIGHTED CLIQUE GRAPHS
GRAPH CLASSES STRUCTURAL CHARACTERIZATION
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
dc.creator.none.fl_str_mv Bonomo, Flavia
Szwarcfiter, Jayme L.
author Bonomo, Flavia
author_facet Bonomo, Flavia
Szwarcfiter, Jayme L.
author_role author
author2 Szwarcfiter, Jayme L.
author2_role author
dc.subject.none.fl_str_mv WEIGHTED CLIQUE GRAPHS
GRAPH CLASSES STRUCTURAL CHARACTERIZATION
topic WEIGHTED CLIQUE GRAPHS
GRAPH CLASSES STRUCTURAL CHARACTERIZATION
purl_subject.fl_str_mv https://purl.org/becyt/ford/1.1
https://purl.org/becyt/ford/1
https://purl.org/becyt/ford/1.2
https://purl.org/becyt/ford/1
dc.description.none.fl_txt_mv 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.
Fil: Bonomo, Flavia. Consejo Nacional de Investigaciones Científicas y Técnicas. Oficina de Coordinación Administrativa Ciudad Universitaria. Instituto de Investigaciones Matemáticas "Luis A. Santaló". Universidad de Buenos Aires. Facultad de Ciencias Exactas y Naturales. Instituto de Investigaciones Matemáticas "Luis A. Santaló"; Argentina
Fil: Szwarcfiter, Jayme L.. Universidade Federal do Rio de Janeiro; Brasil
4th Latin-American Workshop on Cliques in Graphs
Itaipava
Brasil
Sociedade Brasileira de Matemática
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.
publishDate 2010
dc.date.none.fl_str_mv 2010
dc.type.none.fl_str_mv info:eu-repo/semantics/publishedVersion
info:eu-repo/semantics/conferenceObject
Workshop
Journal
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
status_str publishedVersion
format conferenceObject
dc.identifier.none.fl_str_mv http://hdl.handle.net/11336/282050
On weighted clique graphs; 4th Latin-American Workshop on Cliques in Graphs; Itaipava; Brasil; 2010; 9-22
2317-6636
CONICET Digital
CONICET
url http://hdl.handle.net/11336/282050
identifier_str_mv On weighted clique graphs; 4th Latin-American Workshop on Cliques in Graphs; Itaipava; Brasil; 2010; 9-22
2317-6636
CONICET Digital
CONICET
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://mc.sbm.org.br/volumes/volume-39/
info:eu-repo/semantics/altIdentifier/doi/10.21711/231766362010/rmc392
info:eu-repo/semantics/altIdentifier/url/https://mc.sbm.org.br/wp-content/uploads/sites/15/2021/08/39-2.pdf
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
eu_rights_str_mv openAccess
rights_invalid_str_mv https://creativecommons.org/licenses/by-nc-sa/2.5/ar/
dc.format.none.fl_str_mv application/pdf
application/pdf
application/pdf
dc.coverage.none.fl_str_mv Internacional
dc.publisher.none.fl_str_mv Sociedade Brasileira de Matemática
publisher.none.fl_str_mv Sociedade Brasileira de Matemática
dc.source.none.fl_str_mv reponame:CONICET Digital (CONICET)
instname:Consejo Nacional de Investigaciones Científicas y Técnicas
reponame_str CONICET Digital (CONICET)
collection CONICET Digital (CONICET)
instname_str Consejo Nacional de Investigaciones Científicas y Técnicas
repository.name.fl_str_mv CONICET Digital (CONICET) - Consejo Nacional de Investigaciones Científicas y Técnicas
repository.mail.fl_str_mv dasensio@conicet.gov.ar; lcarlino@conicet.gov.ar
_version_ 1861214531784540160
score 12.822162

Publicaciones similares