Pages that link to "Item:Q5563303"
From MaRDI portal
The following pages link to Dominating Set and Converse Dominating Set of a Directed Graph (Q5563303):
Displaying 19 items.
- On the rainbow domination number of digraphs (Q343745) (← links)
- Directed domination in oriented graphs (Q423913) (← links)
- On the \((h,k)\)-domination numbers of iterated line digraphs (Q444453) (← links)
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem (Q450578) (← links)
- A greedy partition lemma for directed domination (Q665996) (← links)
- Domination and location in twin-free digraphs (Q777359) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Domination in a digraph and in its reverse (Q967348) (← links)
- A note on Roman domination of digraphs (Q1630917) (← links)
- Bounds on the domination number of a digraph (Q1698058) (← links)
- Double Roman domination in digraphs (Q2272602) (← links)
- Packing and domination parameters in digraphs (Q2328107) (← links)
- Domination in Digraphs (Q3384119) (← links)
- Directed Dominating Set Problem Studied by Cavity Method: Warning Propagation and Population Dynamics (Q3387676) (← links)
- The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation (Q3452554) (← links)
- Total Roman domination in digraphs (Q4986528) (← links)
- Total double Roman domination numbers in digraphs (Q5101908) (← links)
- Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)
- Extremal Digraphs for open neighbourhood location-domination and identifying codes (Q6202938) (← links)