Open AccessArc domination in digraphs
Author(s) -
R. Anbunathan,
R. Rajeswari
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1770/1/012075
Subject(s) - digraph , arc (geometry) , combinatorics , cardinality (data modeling) , mathematics , dominating set , domination analysis , set (abstract data type) , discrete mathematics , graph , computer science , vertex (graph theory) , geometry , data mining , programming language
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.