Bounds on the domination number of a digraph and its reverse
From MaRDI portal
Publication:5024936
Recommendations
Cites work
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 1270237 (Why is no real title available?)
- scientific article; zbMATH DE number 1095171 (Why is no real title available?)
- scientific article; zbMATH DE number 1095172 (Why is no real title available?)
- scientific article; zbMATH DE number 1529462 (Why is no real title available?)
- A survey of selected recent results on total domination in graphs
- Characterization of digraphs with equal domination graphs and underlying graphs
- Dominating sets in directed graphs
- Domination in a digraph and in its reverse
- Domination in lexicographic product digraphs.
- Graphs with large total domination number
- Hypergraphs with large transversal number and with edge sizes at least 3
- Independence in 5-uniform hypergraphs
- On the difference of the domination number of a digraph and of its reverse
- On the domination numbers of generalized de Bruijn digraphs and generalized Kautz digraphs
- On the out-domination and in-domination numbers of a digraph
- On the sum of out-domination number and in-domination number of digraphs.
- Some remarks on domination
- Total domination in graphs
- Total domination of graphs and small transversals of hypergraphs
Cited in
(7)- On the sum of the total domination numbers of a digraph and its converse
- On the difference of the domination number of a digraph and of its reverse
- A note on lower bounds for the total domination number of digraphs
- Domination in a digraph and in its reverse
- Bounds on the domination number of a digraph
- Dominance in a Cayley digraph and in its reverse
- On domination of orientations and their reverses in graphs
This page was built for publication: Bounds on the domination number of a digraph and its reverse
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5024936)