Loading...
Loading...

Go to the content (press return)

Limited broadcast domination

Author
Hernando, M.; Mora, M.; Pelayo, I. M.; Cáceres, José; Puertas, M. Luz
Type of activity
Presentation of work at congresses
Name of edition
Bordeaux Graph Workshop 2016
Date of publication
2016
Presentation's date
2016-11-08
Book of congress proceedings
Bordeaux Graph Workshop 2016 Enseirb-Matmeca & LaBRI, Bordeaux, France November 7-10, 2016
First page
64
Last page
65
URL
http://bgw.labri.fr/2016/bgw2016-booklet.pdf Open in new window
Abstract
Domination in graphs has shown as a extremely fruitful concept, since it was originally dened in the late fities [1] and named in the early sixties [7]. A dominating set of a graph G is a vertex set S such that any vertex not in S has at least one neighbor in S. Multiple variants of domination have been dened over the past fty years, putting the focus on diferent aspects. One of them is the idea of broadcasting, rstly introduced in [6] and taken up more recently in [3]. This model reects the ide...
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications
DCG - Discrete and Combinatorial Geometry

Participants