Pages that link to "Item:Q1292825"
From MaRDI portal
The following pages link to On the out-domination and in-domination numbers of a digraph (Q1292825):
Displaying 16 items.
- Directed domination in oriented graphs (Q423913) (← links)
- On the difference of the domination number of a digraph and of its reverse (Q423949) (← links)
- On the \((h,k)\)-domination numbers of iterated line digraphs (Q444453) (← links)
- A greedy partition lemma for directed domination (Q665996) (← links)
- Domination in a digraph and in its reverse (Q967348) (← links)
- Dominating sets in directed graphs (Q991901) (← links)
- Partitioning vertices into in- and out-dominating sets in digraphs (Q2197403) (← links)
- Extremal \(k\)-forcing sets in oriented graphs (Q2416417) (← links)
- Efficient dominating sets in labeled rooted oriented trees (Q2581421) (← links)
- Rainbow reinforcement numbers in digraphs (Q2979763) (← links)
- Domination in Digraphs (Q3384119) (← links)
- On the sum of the total domination numbers of a digraph and its converse (Q4622851) (← links)
- Bounds on the domination number of a digraph and its reverse (Q5024936) (← links)
- On the domination polynomial of a digraph: a generation function approach (Q5065224) (← 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)
