A note on path domination

Autores
Alcón, Liliana Graciela
Año de publicación
2016
Idioma
inglés
Tipo de recurso
artículo
Estado
versión publicada
Descripción
We study domination between different types of walks connecting two non-adjacent vertices u and v of a graph (shortest paths, induced paths, paths, tolled walks). We succeeded in characterizing those graphs in which every uv-walk of one particular kind dominates every uv-walk of other specific kind. We thereby obtained new characterizations of standard graph classes like chordal, interval and superfragile graphs.
Facultad de Ciencias Exactas
Materia
Matemática
Chordal graphs
Domination
Geodesics
Interval graphs
Paths
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-nd/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/86283
Acceder
id SEDICI_d73d378b9be517da4a7cd131752bb63c
oai_identifier_str oai:sedici.unlp.edu.ar:10915/86283
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling A note on path dominationAlcón, Liliana GracielaMatemáticaChordal graphsDominationGeodesicsInterval graphsPathsWe study domination between different types of walks connecting two non-adjacent vertices u and v of a graph (shortest paths, induced paths, paths, tolled walks). We succeeded in characterizing those graphs in which every uv-walk of one particular kind dominates every uv-walk of other specific kind. We thereby obtained new characterizations of standard graph classes like chordal, interval and superfragile graphs.Facultad de Ciencias Exactas2016info:eu-repo/semantics/articleinfo:eu-repo/semantics/publishedVersionArticulohttp://purl.org/coar/resource_type/c_6501info:ar-repo/semantics/articuloapplication/pdf1021-1034http://sedici.unlp.edu.ar/handle/10915/86283enginfo:eu-repo/semantics/altIdentifier/issn/2083-5892info:eu-repo/semantics/altIdentifier/doi/10.7151/dmgt.1917info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-nd/4.0/Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-29T11:16:50Zoai:sedici.unlp.edu.ar:10915/86283Institucionalhttp://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:16:50.444SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv A note on path domination
title A note on path domination
spellingShingle A note on path domination
Alcón, Liliana Graciela
Matemática
Chordal graphs
Domination
Geodesics
Interval graphs
Paths
title_short A note on path domination
title_full A note on path domination
title_fullStr A note on path domination
title_full_unstemmed A note on path domination
title_sort A note on path domination
dc.creator.none.fl_str_mv Alcón, Liliana Graciela
author Alcón, Liliana Graciela
author_facet Alcón, Liliana Graciela
author_role author
dc.subject.none.fl_str_mv Matemática
Chordal graphs
Domination
Geodesics
Interval graphs
Paths
topic Matemática
Chordal graphs
Domination
Geodesics
Interval graphs
Paths
dc.description.none.fl_txt_mv We study domination between different types of walks connecting two non-adjacent vertices u and v of a graph (shortest paths, induced paths, paths, tolled walks). We succeeded in characterizing those graphs in which every uv-walk of one particular kind dominates every uv-walk of other specific kind. We thereby obtained new characterizations of standard graph classes like chordal, interval and superfragile graphs.
Facultad de Ciencias Exactas
description We study domination between different types of walks connecting two non-adjacent vertices u and v of a graph (shortest paths, induced paths, paths, tolled walks). We succeeded in characterizing those graphs in which every uv-walk of one particular kind dominates every uv-walk of other specific kind. We thereby obtained new characterizations of standard graph classes like chordal, interval and superfragile graphs.
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/86283
url http://sedici.unlp.edu.ar/handle/10915/86283
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/altIdentifier/issn/2083-5892
info:eu-repo/semantics/altIdentifier/doi/10.7151/dmgt.1917
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-nd/4.0/
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-nd/4.0/
Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)
dc.format.none.fl_str_mv application/pdf
1021-1034
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_ 1844616041253044224
score 13.070432

Publicaciones similares