Domination and fractional domination in digraphs (Q1671654)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Domination and fractional domination in digraphs |
scientific article |
Statements
Domination and fractional domination in digraphs (English)
0 references
7 September 2018
0 references
Summary: In this paper, we investigate the relation between the (fractional) domination number of a digraph \(G\) and the independence number of its underlying graph, denoted by \(\alpha(G)\). More precisely, we prove that every digraph \(G\) on \(n\) vertices has fractional domination number at most \(2\alpha(G)\) and domination number at most \(2\alpha(G) \cdot \log{n}\). Both bounds are sharp.
0 references
graphs and digraphs
0 references
domination
0 references
fractional domination
0 references