Ponencia
Distance domination, guarding and vertex cover for maximal outerplanar graphs
Autor/es | Canales Cano, Santiago
Hernández Peñalver, Gregorio Oliveira Martins, Ana Mafalda de Matos. Inês |
Coordinador/Director | Díaz Báñez, José Miguel
Garijo Royo, Delia Márquez Pérez, Alberto Urrutia Galicia, Jorge |
Departamento | Universidad de Sevilla. Departamento de Matemática Aplicada II |
Fecha de publicación | 2013 |
Fecha de depósito | 2017-05-18 |
Publicado en |
|
Resumen | In this paper we de ne a distance guarding concept on plane graphs and associate this concept with distance domination and distance vertex cover concepts on triangulation graphs. Furthermore, for any n-vertex maximal ... In this paper we de ne a distance guarding concept on plane graphs and associate this concept with distance domination and distance vertex cover concepts on triangulation graphs. Furthermore, for any n-vertex maximal outerplanar graph, we provide tight upper bounds for g2d(n) (2d-guarding number), γ2d(n) (2d-domination number) and β2d(n) (2d-vertex cover number). |
Identificador del proyecto | ComPoSe IP04
EUI-EURC-2011-4306 SFRH/BPD/66431/2009 PEstC/MAT/UI4106/2011 FCOMP- 01-0124-FEDER-022690 |
Cita | Canales Cano, S., Hernández Peñalver, G., Oliveira Martins, A.M.d. y Matos. Inês, (2013). Distance domination, guarding and vertex cover for maximal outerplanar graphs. En XV Spanish Meeting on Computational Geometry, Sevilla. |
Ficheros | Tamaño | Formato | Ver | Descripción |
---|---|---|---|---|
Distance domination, guarding ... | 712.7Kb | [PDF] | Ver/ | |