On the k-domination number of digraphs

Lyes Ouldrabah (), Mostafa Blidia () and Ahmed Bouchou ()
Additional contact information
Lyes Ouldrabah: University of Blida 1
Mostafa Blidia: University of Blida 1
Ahmed Bouchou: University of Médéa

Journal of Combinatorial Optimization, 2019, vol. 38, issue 3, No 2, 680-688

Abstract: Abstract Let $$k\ge 1$$ k ≥ 1 be an integer and let D be a digraph with vertex set V(D). A subset $$S\subseteq V(D)$$ S ⊆ V ( D ) is called a k-dominating set if every vertex not in S has at least k predecessors in S. The k-domination number $$\gamma _{k}(D)$$ γ k ( D ) of D is the minimum cardinality of a k-dominating set in D. We know that for any digraph D of order n, $$\gamma _{k}(D)\le n$$ γ k ( D ) ≤ n . Obviously the upper bound n is sharp for a digraph with maximum in-degree at most $$k-1$$ k - 1 . In this paper we present some lower and upper bounds on $$\gamma _{k}(D)$$ γ k ( D ) . Also, we characterize digraphs achieving these bounds. The special case $$k=1$$ k = 1 mostly leads to well known classical results.

Keywords: Digraphs; Oriented graphs; k-domination number; Tournament; 05C20; 05C69 (search for similar items in EconPapers)
Date: 2019
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00405-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:38:y:2019:i:3:d:10.1007_s10878-019-00405-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-019-00405-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().