On the out-domination and in-domination numbers of a digraph
From MaRDI portal
Publication:1292825
DOI10.1016/S0012-365X(99)90059-6zbMath0978.05057MaRDI QIDQ1292825
Frank Harary, Bill Quan Yue, Gary Chartrand
Publication date: 27 January 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)
05C20: Directed graphs (digraphs), tournaments
Related Items
On the sum of the total domination numbers of a digraph and its converse, Bounds on the domination number of a digraph and its reverse, On the domination polynomial of a digraph: a generation function approach, 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, 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, A greedy partition lemma for directed domination, Domination in a digraph and in its reverse, Dominating sets in directed graphs, Partitioning vertices into in- and out-dominating sets in digraphs, Extremal \(k\)-forcing sets in oriented graphs, Efficient dominating sets in labeled rooted oriented trees, Rainbow reinforcement numbers in digraphs, Domination in Digraphs
Cites Work
