@Article{Sonntag2010,
author = "Sonntag, Martin and Teichert, Hanns-Martin",
title = "Domination hypergraphs of certain digraphs",
journal = "Opuscula Math.",
year = "2010",
volume = "30",
number = "2",
pages = "179--191",
doi = "http://dx.doi.org/10.7494/OpMath.2010.30.2.179",
url = "http://dx.doi.org/10.7494/OpMath.2010.30.2.179",
abstract = "If \(D = (V,A)\) is a digraph, its domination hypergraph \(\mathcal{DH}(D) = (V,\mathcal{E})\) has the vertex set \(V\) and \(e \subseteq V\) is an edge of \(\mathcal{DH}(D)\) if and only if \(e\) is a minimal dominating set of \(D\). We investigate domination hypergraphs of special classes of digraphs, namely tournaments, paths and cycles. Finally, using a special decomposition/composition method we construct edge sets of domination hypergraphs of certain digraphs.",
keywords = "hypergraph, dominating set, directed graph",
issn = "1232-9274"
}