Domination and fractional domination in digraphs - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue The Electronic Journal of Combinatorics Année : 2018

Domination and fractional domination in digraphs

Résumé

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$ has fractional domination number at most $2\alpha(G)$, and every directed triangle-free digraph $G$ has domination number at most $\alpha(G)\cdot \alpha(G)!$. The first bound is sharp.

Dates et versions

hal-01990176 , version 1 (22-01-2019)

Identifiants

Citer

Ararat Harutyunyan, Tien-Nam Le, Alantha Newman, Stéphan Thomassé. Domination and fractional domination in digraphs. The Electronic Journal of Combinatorics, 2018, 25 (3), pp.P3.32. ⟨hal-01990176⟩
72 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More