A note on path domination
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....
Guardado en:
| Autor principal: | Alcón, Liliana Graciela |
|---|---|
| Formato: | Articulo |
| Lenguaje: | Inglés |
| Publicado: |
2016
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/86283 |
| Aporte de: |
Ejemplares similares
-
End simplicial vertices in path graphs
por: Gutiérrez, Marisa, et al.
Publicado: (2016) -
Intersection Graphs and the Clique Operator
por: Gutiérrez, Marisa
Publicado: (2001) -
Powers of cycles, powers of paths, and distance graphs
por: Lin, M.C., et al.
Publicado: (2011) -
Powers of cycles, powers of paths, and distance graphs
por: Lin, M.C., et al.
Publicado: (2011) -
Powers of cycles, powers of paths, and distance graphs
por: Lin, M.C., et al.