|
Descripción
|
|
|---|---|
| In this paper we de?fine 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 g_2d(n) (2d-guarding number), gamma_2d(n) (2d-domination number) and ?beta_2d(n) (2d-vertex cover number). | |
|
Internacional
|
Si |
|
Nombre congreso
|
XV Spanish Meeting on Computacional Geometry, EGC2013 |
|
Tipo de participación
|
960 |
|
Lugar del congreso
|
Sevilla |
|
Revisores
|
Si |
|
ISBN o ISSN
|
978-84-92774-11-1 |
|
DOI
|
|
|
Fecha inicio congreso
|
26/06/2013 |
|
Fecha fin congreso
|
28/06/2013 |
|
Desde la página
|
51 |
|
Hasta la página
|
54 |
|
Título de las actas
|
Proceedings XV Spanish Meeting on Computacional Geometry, EGC2013 |