On the \(k\)-domination number of digraphs

DOI10.1007/s10878-019-00405-1zbMath1429.05158OpenAlexW2924487524WikidataQ128181610 ScholiaQ128181610MaRDI QIDQ2331578

Mostafa Blidia, Lyes Ouldrabah, Ahmed Bouchou

Publication date: 29 October 2019

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-019-00405-1

zbMATH Keywords

digraphstournamentoriented graphs\(k\)-domination number

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Classes of intersection digraphs with good algorithmic properties ⋮ The domination number of round digraphs ⋮ A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs

Cites Work

• A new generalization of kernels in digraphs
• \(k\)-domination and \(k\)-independence in graphs: A survey
• Planar kernel and Grundy with \(d\leq 3\), \(dout\leq 2\), \(din\leq 2\) are NP- complete
• An upper bound for thek-domination number of a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On the \(k\)-domination number of digraphs