End simplicial vertices in path graphs

Autores
Gutiérrez, Marisa; Tondato, Silvia Beatriz
Año de publicación
2016
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
A graph is a path graph if there is a tree, called UV-model, whose vertices are the maximal cliques of the graph and for each vertex x of the graph the set of maximal cliques that contains it induces a path in the tree. A graph is an interval graph if there is a UV-model that is a path, called an interval model. Gimbel [3] characterized those vertices in interval graphs for which there is some interval model where the interval corresponding to those vertices is an end interval. In this work, we give a characterization of those simplicial vertices x in path graphs for which there is some t/V-model where the maximal clique containing x is a leaf in this UV-model.
Facultad de Ciencias Exactas
Materia
Matemática
Chordal graphs
Clique trees
Path graphs
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/87295
Acceder
id SEDICI_3b0864d0dc7a917aad1356b4fa0a192c
oai_identifier_str oai:sedici.unlp.edu.ar:10915/87295
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling End simplicial vertices in path graphsGutiérrez, MarisaTondato, Silvia BeatrizMatemáticaChordal graphsClique treesPath graphsA graph is a path graph if there is a tree, called UV-model, whose vertices are the maximal cliques of the graph and for each vertex x of the graph the set of maximal cliques that contains it induces a path in the tree. A graph is an interval graph if there is a UV-model that is a path, called an interval model. Gimbel [3] characterized those vertices in interval graphs for which there is some interval model where the interval corresponding to those vertices is an end interval. In this work, we give a characterization of those simplicial vertices x in path graphs for which there is some t/V-model where the maximal clique containing x is a leaf in this UV-model.Facultad de Ciencias Exactas2016info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf393-408http://sedici.unlp.edu.ar/handle/10915/87295enginfo:eu-repo/semantics/altIdentifier/issn/1234-3099info:eu-repo/semantics/altIdentifier/doi/10.7151/dmgt.1866info: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-03T10:49:08Zoai:sedici.unlp.edu.ar:10915/87295Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:49:08.787SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv End simplicial vertices in path graphs
title End simplicial vertices in path graphs
spellingShingle End simplicial vertices in path graphs
Gutiérrez, Marisa
Matemática
Chordal graphs
Clique trees
Path graphs
title_short End simplicial vertices in path graphs
title_full End simplicial vertices in path graphs
title_fullStr End simplicial vertices in path graphs
title_full_unstemmed End simplicial vertices in path graphs
title_sort End simplicial vertices in path graphs
dc.creator.none.fl_str_mv Gutiérrez, Marisa
Tondato, Silvia Beatriz
author Gutiérrez, Marisa
author_facet Gutiérrez, Marisa
Tondato, Silvia Beatriz
author_role author
author2 Tondato, Silvia Beatriz
author2_role author
dc.subject.none.fl_str_mv Matemática
Chordal graphs
Clique trees
Path graphs
topic Matemática
Chordal graphs
Clique trees
Path graphs
dc.description.none.fl_txt_mv A graph is a path graph if there is a tree, called UV-model, whose vertices are the maximal cliques of the graph and for each vertex x of the graph the set of maximal cliques that contains it induces a path in the tree. A graph is an interval graph if there is a UV-model that is a path, called an interval model. Gimbel [3] characterized those vertices in interval graphs for which there is some interval model where the interval corresponding to those vertices is an end interval. In this work, we give a characterization of those simplicial vertices x in path graphs for which there is some t/V-model where the maximal clique containing x is a leaf in this UV-model.
Facultad de Ciencias Exactas
description A graph is a path graph if there is a tree, called UV-model, whose vertices are the maximal cliques of the graph and for each vertex x of the graph the set of maximal cliques that contains it induces a path in the tree. A graph is an interval graph if there is a UV-model that is a path, called an interval model. Gimbel [3] characterized those vertices in interval graphs for which there is some interval model where the interval corresponding to those vertices is an end interval. In this work, we give a characterization of those simplicial vertices x in path graphs for which there is some t/V-model where the maximal clique containing x is a leaf in this UV-model.
publishDate 2016
dc.date.none.fl_str_mv 2016
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/87295
url http://sedici.unlp.edu.ar/handle/10915/87295
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/1234-3099
info:eu-repo/semantics/altIdentifier/doi/10.7151/dmgt.1866
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
393-408
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_ 1842260367790571520
score 13.13397

Publicaciones similares