Total and connected domination in digraphs
From MaRDI portal
Recommendations
Cited in
(19)- On efficiently total dominatable digraphs
- Packing and domination parameters in digraphs
- Domination in digraphs
- Directed domination in oriented graphs
- On the sum of the total domination numbers of a digraph and its converse
- Semicomplete absorbent sets in digraphs
- Total Roman domination in digraphs
- Signed total Roman domination in digraphs
- Domination parameters on Cayley digraphs of transformation semigroups with fixed sets
- Total double Roman domination numbers in digraphs
- Total domination in digraphs
- A note on lower bounds for the total domination number of digraphs
- Size, Order, and Connected Domination
- Classes of intersection digraphs with good algorithmic properties
- A greedy partition lemma for directed domination
- Orientable total domination in graphs
- Total 2-domination number in digraphs and its dual parameter
- Domination parameters on Cayley digraphs of full transformation semigroups relative to Green's equivalence \(\mathcal{L}\)-classes and their complements
- Total domination number of the conjunction of graphs
This page was built for publication: Total and connected domination in digraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5442546)
