Arc domination in digraphs
R. Anbunathan, R. Raja Rajeswari · Journal of Physics Conference Series · 2021
Abstract Let D = (V, A) be a digraph. A subset S of arc set in a digraph D is called an arc dominating set of D if for every arc(v, w) ∈ A/S, there exists an arc(u, v) ∈ S such that {(u, v), (v, w)} ∈ A. The minimum cardinality of an arc dominating set of D is called the arc domination number of D and is donated by γ′ (D). In this paper, arc domination number for various digraphs were determined and also derived a characterization for minimal arc dominating sets of digraphs.