Independent Domination in Directed Graphs

09/11/2019
by   Michael Cary, et al.
0

In this paper we initialize the study of independent domination in directed graphs. We show that an independent dominating set of an orientation of a graph is also an independent dominating set of the underlying graph, but that the converse is not true in general. We then prove existence and uniqueness theorems for several classes of digraphs including orientations of complete graphs, paths, trees, DAGs, cycles, and bipartite graphs. We also provide the idomatic number for special cases of some of these families of digraphs.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 1

page 2

page 3

page 4

10/12/2019

Independent Dominating Sets in Directed Graphs

In this paper, we study independent domination in directed graphs, which...
05/24/2018

Eternal dominating sets on digraphs and orientations of graphs

We study the eternal dominating number and the m-eternal dominating numb...
01/02/2018

Secretary problem: graphs, matroids and greedoids

In the paper the generalisation of the well known "secretary problem" is...
01/31/2022

The road problem and homomorphisms of directed graphs

We make progress on a generalization of the road (colouring) problem. Th...
04/06/2021

Upper paired domination versus upper domination

A paired dominating set P is a dominating set with the additional proper...
04/16/2020

Approximating Independent Set and Dominating Set on VPG graphs

We consider Independent Set and Dominating Set restricted to VPG graphs ...
02/20/2020

A general kernelization technique for domination and independence problems in sparse classes

We unify and extend previous kernelization techniques in sparse classes ...
This week in AI

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