On the out-domination and in-domination numbers of a digraph
From MaRDI portal
Publication:1292825
Recommendations
Cites work
- scientific article; zbMATH DE number 1055145 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1124608 (Why is no real title available?)
- scientific article; zbMATH DE number 3226832 (Why is no real title available?)
- Parallel concepts in graph theory
Cited in
(26)- Domination in a digraph and in its reverse
- Bounds on the domination number in oriented graphs
- On the domination polynomial of a digraph: a generation function approach
- Dominating sets in directed graphs
- scientific article; zbMATH DE number 3970787 (Why is no real title available?)
- Characterization of digraphs with equal domination graphs and underlying graphs
- The domination number of round digraphs
- On the difference of the domination number of a digraph and of its reverse
- Efficient dominating sets in labeled rooted oriented trees
- On the sum of the total domination numbers of a digraph and its converse
- On the \((h,k)\)-domination numbers of iterated line digraphs
- On the sum of out-domination number and in-domination number of digraphs.
- Sum of out-domination number and in-domination number of digraphs
- Domination number of an interval catch digraph family and its use for testing uniformity
- scientific article; zbMATH DE number 1933242 (Why is no real title available?)
- Domination and fractional domination in digraphs
- Bounds on the domination number of a digraph and its reverse
- Domination in digraphs
- \(k\)-distinct in- and out-branchings in digraphs
- Directed domination in oriented graphs
- Extremal \(k\)-forcing sets in oriented graphs
- Partitioning vertices into in- and out-dominating sets in digraphs
- A note on lower bounds for the total domination number of digraphs
- On the domination number of digraphs.
- A greedy partition lemma for directed domination
- Rainbow reinforcement numbers in digraphs
This page was built for publication: On the out-domination and in-domination numbers of a digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1292825)