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.
@article{bwmeta1.element.doi-10_7151_dmgt_1917,
author = {Liliana Alc\'on},
title = {A Note on Path Domination},
journal = {Discussiones Mathematicae Graph Theory},
volume = {36},
year = {2016},
pages = {1021-1034},
zbl = {1350.05069},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_7151_dmgt_1917}
}
Liliana Alcón. A Note on Path Domination. Discussiones Mathematicae Graph Theory, Tome 36 (2016) pp. 1021-1034. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_7151_dmgt_1917/