Domination in a digraph and in its reverse

DOI10.1016/j.dam.2009.04.011zbMath1211.05121OpenAlexW2026601060MaRDI QIDQ967348

Martin Knor, L'udovít Niepel

Publication date: 28 April 2010

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2009.04.011

zbMATH Keywords

directed graphdomination numbertotal domination numberconversereverse digraph

Mathematics Subject Classification ID

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

Related Items (5)

On the difference of the domination number of a digraph and of its reverse ⋮ On the \((h,k)\)-domination numbers of iterated line digraphs ⋮ Domination in Digraphs ⋮ Domination number of an interval catch digraph family and its use for testing uniformity ⋮ Bounds on the domination number of a digraph and its reverse

Cites Work

• On the out-domination and in-domination numbers of a digraph
• Dominating Set and Converse Dominating Set of a Directed Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Domination in a digraph and in its reverse