Eternal dominating sets on digraphs and orientations of graphs

05/24/2018
by   Guillaume Bagan, et al.
0

We study the eternal dominating number and the m-eternal dominating number on digraphs. We generalize known results on graphs to digraphs. We also consider the problem "oriented (m-)eternal domination", consisting in finding an orientation of a graph that minimizes its eternal dominating number. We prove that computing the oriented eternal dominating number is NP-hard and characterize the graphs for which the oriented m-eternal dominating number is 2. We also study these two parameters on trees, cycles, complete graphs, complete bipartite graphs, trivially perfect graphs and different kinds of grids and products of graphs.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

09/11/2019

Independent Domination in Directed Graphs

In this paper we initialize the study of independent domination in direc...
02/16/2021

Roman Domination of the Comet, Double Comet, and Comb Graphs

One of the well-known measurements of vulnerability in graph theory is d...
06/25/2019

Asymptotic growth rate of square grids dominating sets: a symbolic dynamics approach

In this text, we prove the existence of an asymptotic growth rate of the...
02/05/2018

Optimal bounds on codes for location in circulant graphs

Identifying and locating-dominating codes have been studied widely in ci...
12/21/2021

Sparse dominating sets and balanced neighborhood partitioning

Recent work in metagenomics constructs a partition of the assembly graph...
04/06/2021

Upper paired domination versus upper domination

A paired dominating set P is a dominating set with the additional proper...
05/15/2019

Perfect Italian domination on planar and regular graphs

A perfect Italian dominating function of a graph G=(V,E) is a function f...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.