The domination number of round digraphs

The concept of the domination number plays an important role in both theory and applications of digraphs. Let D=(V,A)D=(V,A) be a digraph. A vertex subset T⊆V(D)T\subseteq V(D) is called a dominating set of D, if there is a vertex t∈Tt\in T such that tv∈A(D)tv\in A(D) for every vertex v∈V(D)\Tv\in V(D)\backslash T. The dominating number of D is the cardinality of a smallest dominating set of D, denoted by γ(D)\gamma (D). In this paper, the domination number of round digraphs is characterized completely.

Abstract licence: CC BY

A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.