|
Descripción
|
|
|---|---|
| In this paper we introduce the notion of distance k-guarding applied to triangulation graphs, and associate it with distance k-domination and distance k-covering. We obtain results for maximal outerplanar graphs when k = 2. A set S of vertices in a triangulation graph T is a distance 2-guarding set (or 2d-guarding set for short) if every face of T has a vertex adjacent to a vertex of S. We show that ?n/5? (respectively, ?n/4?) vertices are sufficient to 2d-guard and 2d-dominate (respectively, 2d-cover) any n-vertex maximal outerplanar graph. We also show that these bounds are tight | |
|
Internacional
|
Si |
|
JCR del ISI
|
Si |
|
Título de la revista
|
Discrete Applied Mathematics |
|
ISSN
|
0166-218X |
|
Factor de impacto JCR
|
0,677 |
|
Información de impacto
|
|
|
Volumen
|
181 |
|
DOI
|
10.1016/j.dam.2014.08.040 |
|
Número de revista
|
|
|
Desde la página
|
41 |
|
Hasta la página
|
49 |
|
Mes
|
SIN MES |
|
Ranking
|
|