Dominating Set and Converse Dominating Set of a Directed Graph
From MaRDI portal
Recommendations
- Dominating sets in directed graphs
- scientific article; zbMATH DE number 4070954
- Set domination in graphs
- scientific article; zbMATH DE number 4202311
- Dominating Functions and Graphs
- Directed domination in oriented graphs
- On Dominating Sets and Independent Sets of Graphs
- Dominating sets in perfect graphs
- Domination in a digraph and in its reverse
- On total dominating sets in graphs
Cited in
(20)- A note on Roman domination of digraphs
- Bounds on the domination number of a digraph
- Double Roman domination in digraphs
- Packing and domination parameters in digraphs
- Domination in digraphs
- Directed dominating set problem studied by cavity method: warning propagation and population dynamics
- On the rainbow domination number of digraphs
- The directed dominating set problem: generalized leaf removal and belief propagation
- Directed domination in oriented graphs
- On the (h,k)-domination numbers of iterated line digraphs
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem
- Total Roman domination in digraphs
- Total double Roman domination numbers in digraphs
- Classes of intersection digraphs with good algorithmic properties
- Extremal Digraphs for open neighbourhood location-domination and identifying codes
- A greedy partition lemma for directed domination
- Total 2-domination number in digraphs and its dual parameter
- Domination and location in twin-free digraphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Domination in a digraph and in its reverse
This page was built for publication: Dominating Set and Converse Dominating Set of a Directed Graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5563303)
