TY  - JOUR
ID  - Sonntag2010
LB  - Sonntag2010
AU  - Sonntag, Martin
AU  - Teichert, Hanns-Martin
TI  - Domination hypergraphs of certain digraphs
ST  - Domination hypergraphs of certain digraphs
JO  - Opuscula Math.
JA  - Opuscula Math.
JF  - Opuscula Mathematica
PY  - 2010
VL  - 30
IS  - 2
SP  - 179
EP  - 191
DO  - http://dx.doi.org/10.7494/OpMath.2010.30.2.179
UR  - http://dx.doi.org/10.7494/OpMath.2010.30.2.179
AB  - 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.
KW  - hypergraph
KW  - dominating set
KW  - directed graph
SN  - 1232-9274
ER  -