On the correspondence between tree representations of chordal and dually chordal graphs

Autores
De Caria, Pablo Jesús; Gutiérrez, Marisa
Año de publicación
2014
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
Chordal graphs and their clique graphs (called dually chordal graphs) possess characteristic tree representations, namely, the clique tree and the compatible tree, respectively. The following problem is studied: given a chordal graph G, determine if the clique trees of G are exactly the compatible trees of the clique graph of G. This leads to a new subclass of chordal graphs, basic chordal graphs, which is here characterized. The question is also approached backwards: given a dually chordal graph G, we find all the basic chordal graphs with clique graph equal to G. This approach leads to the possibility of considering several properties of clique trees of chordal graphs and finding their counterparts in compatible trees of dually chordal graphs.
Facultad de Ciencias Exactas
Materia
Matemática
Basic chordal graph
Chordal graph
Clique tree
Compatible tree
Dually chordal graph
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/85139
Acceder
id SEDICI_e5d47d565d3b4102c20a8e2f0abd0494
oai_identifier_str oai:sedici.unlp.edu.ar:10915/85139
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling On the correspondence between tree representations of chordal and dually chordal graphsDe Caria, Pablo JesúsGutiérrez, MarisaMatemáticaBasic chordal graphChordal graphClique treeCompatible treeDually chordal graphChordal graphs and their clique graphs (called dually chordal graphs) possess characteristic tree representations, namely, the clique tree and the compatible tree, respectively. The following problem is studied: given a chordal graph G, determine if the clique trees of G are exactly the compatible trees of the clique graph of G. This leads to a new subclass of chordal graphs, basic chordal graphs, which is here characterized. The question is also approached backwards: given a dually chordal graph G, we find all the basic chordal graphs with clique graph equal to G. This approach leads to the possibility of considering several properties of clique trees of chordal graphs and finding their counterparts in compatible trees of dually chordal graphs.Facultad de Ciencias Exactas2014info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf500-511http://sedici.unlp.edu.ar/handle/10915/85139enginfo:eu-repo/semantics/altIdentifier/issn/0166-218Xinfo:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2013.07.011info: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-10-15T11:08:17Zoai:sedici.unlp.edu.ar:10915/85139Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-10-15 11:08:17.662SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv On the correspondence between tree representations of chordal and dually chordal graphs
title On the correspondence between tree representations of chordal and dually chordal graphs
spellingShingle On the correspondence between tree representations of chordal and dually chordal graphs
De Caria, Pablo Jesús
Matemática
Basic chordal graph
Chordal graph
Clique tree
Compatible tree
Dually chordal graph
title_short On the correspondence between tree representations of chordal and dually chordal graphs
title_full On the correspondence between tree representations of chordal and dually chordal graphs
title_fullStr On the correspondence between tree representations of chordal and dually chordal graphs
title_full_unstemmed On the correspondence between tree representations of chordal and dually chordal graphs
title_sort On the correspondence between tree representations of chordal and dually chordal graphs
dc.creator.none.fl_str_mv De Caria, Pablo Jesús
Gutiérrez, Marisa
author De Caria, Pablo Jesús
author_facet De Caria, Pablo Jesús
Gutiérrez, Marisa
author_role author
author2 Gutiérrez, Marisa
author2_role author
dc.subject.none.fl_str_mv Matemática
Basic chordal graph
Chordal graph
Clique tree
Compatible tree
Dually chordal graph
topic Matemática
Basic chordal graph
Chordal graph
Clique tree
Compatible tree
Dually chordal graph
dc.description.none.fl_txt_mv Chordal graphs and their clique graphs (called dually chordal graphs) possess characteristic tree representations, namely, the clique tree and the compatible tree, respectively. The following problem is studied: given a chordal graph G, determine if the clique trees of G are exactly the compatible trees of the clique graph of G. This leads to a new subclass of chordal graphs, basic chordal graphs, which is here characterized. The question is also approached backwards: given a dually chordal graph G, we find all the basic chordal graphs with clique graph equal to G. This approach leads to the possibility of considering several properties of clique trees of chordal graphs and finding their counterparts in compatible trees of dually chordal graphs.
Facultad de Ciencias Exactas
description Chordal graphs and their clique graphs (called dually chordal graphs) possess characteristic tree representations, namely, the clique tree and the compatible tree, respectively. The following problem is studied: given a chordal graph G, determine if the clique trees of G are exactly the compatible trees of the clique graph of G. This leads to a new subclass of chordal graphs, basic chordal graphs, which is here characterized. The question is also approached backwards: given a dually chordal graph G, we find all the basic chordal graphs with clique graph equal to G. This approach leads to the possibility of considering several properties of clique trees of chordal graphs and finding their counterparts in compatible trees of dually chordal graphs.
publishDate 2014
dc.date.none.fl_str_mv 2014
dc.type.none.fl_str_mv info:eu-repo/semantics/article
info:eu-repo/semantics/publishedVersion
Articulo
http://purl.org/coar/resource_type/c_6501
info:ar-repo/semantics/articulo
format article
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/85139
url http://sedici.unlp.edu.ar/handle/10915/85139
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/0166-218X
info:eu-repo/semantics/altIdentifier/doi/10.1016/j.dam.2013.07.011
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
500-511
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_ 1846064139417419776
score 13.22299

Publicaciones similares