Repositorio de producción científica de la Universidad de Sevilla

Distance domination, guarding and vertex cover for maximal outerplanar graphs

 

Advanced Search
 
Opened Access Distance domination, guarding and vertex cover for maximal outerplanar graphs
Cites
Show item statistics
Icon
Export to
Author: Canales Cano, Santiago
Hernández Peñalver, Gregorio
Oliveira Martins, Ana Mafalda de
Matos. Inês
Coordinator/Director: Díaz Báñez, José Miguel
Garijo Royo, Delia
Márquez Pérez, Alberto
Urrutia Galicia, Jorge
Date: 2013
Published in: XV Spanish Meeting on Computational Geometry (2013), p 59-62
Document type: Presentation
Abstract: 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).
Size: 712.7Kb
Format: PDF

URI: http://hdl.handle.net/11441/60030

See editor´s version

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)