The following pages link to (Q4236867):
Displayed 17 items.
- On the rainbow domination number of digraphs (Q343745) (← links)
- Directed domination in oriented graphs (Q423913) (← links)
- On the difference of the domination number of a digraph and of its reverse (Q423949) (← links)
- A greedy partition lemma for directed domination (Q665996) (← links)
- Domination and location in twin-free digraphs (Q777359) (← links)
- Domination in a digraph and in its reverse (Q967348) (← links)
- Bounds on the domination number of a digraph (Q1698058) (← links)
- An investigation of new graph invariants related to the domination number of random proximity catch digraphs (Q2276421) (← links)
- Packing and domination parameters in digraphs (Q2328107) (← links)
- On the \(k\)-domination number of digraphs (Q2331578) (← links)
- Rainbow reinforcement numbers in digraphs (Q2979763) (← links)
- Domination in Digraphs (Q3384119) (← links)
- Bounds on the domination number of a digraph and its reverse (Q5024936) (← links)
- Total double Roman domination numbers in digraphs (Q5101908) (← links)
- Domination number of an interval catch digraph family and its use for testing uniformity (Q5222209) (← links)
- A note on lower bounds for the total domination number of digraphs (Q5236092) (← links)
- Number of Fixed Points and Disjoint Cycles in Monotone Boolean Networks (Q5348493) (← links)