Author:
Anbunathan R.,Rajeswari R.
Abstract
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.
Subject
General Physics and Astronomy
Reference10 articles.
1. Theory of Graphs;Ore,1962
2. Strong weak domination and domination balance in a graph;Sampath kumar;Discrete Math.,1996
3. Gaddum inequalities for domination in graphs;Haynes;Discrete Math.,1996
4. Labeling in Cayley Digraphs;Thirusangu;European Journal of Combinatorics (EJC),2011
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献