Independent Domination in Directed Graphs
Combinatorics
2019-09-12 v1 Discrete Mathematics
Abstract
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.
Cite
@article{arxiv.1909.05121,
title = {Independent Domination in Directed Graphs},
author = {Michael Cary and Jonathan Cary and Savari Prabhu},
journal= {arXiv preprint arXiv:1909.05121},
year = {2019}
}
Comments
14 pages