Published May 18, 2017 | Version v1
Publication Metadata-only

Distance domination, guarding and vertex cover for maximal outerplanar graphs

Creators

Contributors

Description

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).

Abstract

European Science Foundation

Abstract

Ministerio de Ciencia e Innovación

Abstract

Fundação para a Ciência e a Tecnologia

Abstract

Fondo Europeo de Desarrollo Regional

Additional details

Identifiers

URL
https://idus.us.es/handle/11441/60030
URN
urn:oai:idus.us.es:11441/60030

Origin repository

Origin repository
USE