
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.
Fractional domination, 330, 511, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO] Computer Science [cs], Domination, 510, 620, 004, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Principes généraux des mathématiques, FOS: Mathematics, Mathematics - Combinatorics, [INFO]Computer Science [cs], Combinatorics (math.CO), Graphs and digraphs
Fractional domination, 330, 511, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [INFO] Computer Science [cs], Domination, 510, 620, 004, [INFO.INFO-DM] Computer Science [cs]/Discrete Mathematics [cs.DM], Principes généraux des mathématiques, FOS: Mathematics, Mathematics - Combinatorics, [INFO]Computer Science [cs], Combinatorics (math.CO), Graphs and digraphs
| citations This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 5 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
