On weighted clique graphs

Autores
Bonomo, Flavia; Szwarcfiter, Jayme Luiz
Año de publicación
2011
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.
Sociedad Argentina de Informática e Investigación Operativa
Materia
Ciencias Informáticas
Weighted clique graphs
Graph classes structural characterization
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/139353
Acceder
id SEDICI_2ba01541b19055f95e14fa68949f5cc4
oai_identifier_str oai:sedici.unlp.edu.ar:10915/139353
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling On weighted clique graphsBonomo, FlaviaSzwarcfiter, Jayme LuizCiencias InformáticasWeighted clique graphsGraph classes structural characterizationLet 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.Sociedad Argentina de Informática e Investigación Operativa2011-08info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf121-130http://sedici.unlp.edu.ar/handle/10915/139353enginfo:eu-repo/semantics/altIdentifier/url/https://40jaiio.sadio.org.ar/sites/default/files/T2011/SIO/1151.pdfinfo:eu-repo/semantics/altIdentifier/issn/1850-2865info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:35:20Zoai:sedici.unlp.edu.ar:10915/139353Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-29 11:35:20.536SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv On weighted clique graphs
title On weighted clique graphs
spellingShingle On weighted clique graphs
Bonomo, Flavia
Ciencias Informáticas
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 Luiz
author Bonomo, Flavia
author_facet Bonomo, Flavia
Szwarcfiter, Jayme Luiz
author_role author
author2 Szwarcfiter, Jayme Luiz
author2_role author
dc.subject.none.fl_str_mv Ciencias Informáticas
Weighted clique graphs
Graph classes structural characterization
topic Ciencias Informáticas
Weighted clique graphs
Graph classes structural characterization
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.
Sociedad Argentina de Informática e Investigación Operativa
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 2011
dc.date.none.fl_str_mv 2011-08
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/139353
url http://sedici.unlp.edu.ar/handle/10915/139353
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/url/https://40jaiio.sadio.org.ar/sites/default/files/T2011/SIO/1151.pdf
info:eu-repo/semantics/altIdentifier/issn/1850-2865
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
121-130
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1844616232533229568
score 13.070432

Publicaciones similares