On the out-domination and in-domination numbers of a digraph
From MaRDI portal
Publication:1292825
DOI10.1016/S0012-365X(99)90059-6zbMath0978.05057OpenAlexW4210490117MaRDI QIDQ1292825
Frank Harary, Bill Quan Yue, Gary Chartrand
Publication date: 27 January 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90059-6
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)
Related Items (16)
On the domination polynomial of a digraph: a generation function approach ⋮ Extremal \(k\)-forcing sets in oriented graphs ⋮ Partitioning vertices into in- and out-dominating sets in digraphs ⋮ Directed domination in oriented graphs ⋮ On the difference of the domination number of a digraph and of its reverse ⋮ On the \((h,k)\)-domination numbers of iterated line digraphs ⋮ Rainbow reinforcement numbers in digraphs ⋮ On the sum of the total domination numbers of a digraph and its converse ⋮ A greedy partition lemma for directed domination ⋮ Domination in a digraph and in its reverse ⋮ Dominating sets in directed graphs ⋮ Domination in Digraphs ⋮ Domination number of an interval catch digraph family and its use for testing uniformity ⋮ A note on lower bounds for the total domination number of digraphs ⋮ Efficient dominating sets in labeled rooted oriented trees ⋮ Bounds on the domination number of a digraph and its reverse
Cites Work
This page was built for publication: On the out-domination and in-domination numbers of a digraph
