Pages that link to "Item:Q2331578"
From MaRDI portal
The following pages link to On the \(k\)-domination number of digraphs (Q2331578):
Displaying 8 items.
- On the lower bound of \(k\)-maximal digraphs (Q294549) (← links)
- On the difference of the domination number of a digraph and of its reverse (Q423949) (← links)
- On the out-domination and in-domination numbers of a digraph (Q1292825) (← links)
- On the bounded domination number of tournaments (Q1567627) (← links)
- The domination number of round digraphs (Q2053549) (← links)
- A linear time algorithm for weighted \(k\)-fair domination problem in cactus graphs (Q2079283) (← links)
- On the sum of the total domination numbers of a digraph and its converse (Q4622851) (← links)
- Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)